a beamsearch extraction algorithm for comparable data

... et al., 2008; Utiyama and Isahara, 2003; Munteanu and Marcu, 2005; Fung and Cheung, 2004). The novel algorithm is successfully eval- uated on news data for two language pairs. A related approach ... com- parable data (Munteanu and Marcu, 2005). For a given source sentence S, a max- imum entropy (ME) classifier is applied to a large set of candidate target transla- tions . A beam-search algorithm ... far. Whenever a partial matching score is low compared to partial match- ing scores of other target sentence candidates, that translation pair can be discarded by carrying out a beam-search pruning...

Ngày tải lên: 17/03/2014, 02:20

... calculate the gap matrices. For a given gap matrix, we have to con- sider all the different ways that its diagram can be assembled using one or two matrices at a time. (Again, Feynman diagrams ... are energyminimizationalgorithms(Schusteretal., 1997).Whilenotasaccurateascomparative sequence analysis, these algorithms have still pro- ven to be useful research tools. Thermodynamic parameters are available ... characterized bytheTurnergroup(Freieretal.,1986).Dangling bases can also appear inside multiloop diagrams. Notice also that the coaxial diagram in equation (11) really corresponds with four new diagrams because once we allow pairing, dangling bases also...

Ngày tải lên: 12/01/2014, 22:07

... Bahmani A, Naghibzadeh M and Bahmani B (2008) , “Automatic database normalization and primary key generation”, Niagara Falls Canada IEEE. [22] Maier D (1988), “The Theory of relational databases”, ... “Multivalued dependencies and a new normal form for relational databases”, ACM Transactions on Database Systems, Vol.2, No.3, pp.262-278. [14] Fagin R (1979), “Normal forms and relational database ... and keys”, ACM Transactions on Database Systems, Vol.6, No.3, pp.387- 415. [16] Zaniolo C (1982), A new normal form for the design of relational database schemata”, ACM Transactions on Database...

Ngày tải lên: 23/03/2014, 12:20

... search for statistical machine transla- tion. In PACLIC-IO, Pacific Asia Conference on Language, Information and Computation, pages 195-204, Hong Kong, December. Wu, Dekai and Xuanyin Xia. ... identification and trans- lation easier. 4But see the conclusion for a caveat. 154 We have also implemented a generalized version that accepts arbitrary grammars not restricted to normal form, ... 33rd Annual Conference of the Association for Computational Linguistics, pages 244-251, Cambridge, Massachusetts, June. Wu, Dekai. 1995b. Grammarless extraction of phrasal translation examples...

Ngày tải lên: 31/03/2014, 06:20

... recently. For example, by Rockafel- lar [4], Tseng [5], Xia and Huang [6] and the special case (f = 0) was studied by Crou- zeix [7], Danniilidis and Hadjisavvas [8] and Yao [9]. A large variety ... fuquanxia@sina. com 1 Department of Mathematics, Sichuan Normal University, Chengdu, Sichuan 610066, P. R. China Full list of author information is available at the end of the article Abstract In this paper, a projective ... 2011:27 http://www.journalofinequalitiesandapplications.com/content/2011/1/27 Page 4 of 14 RESEARC H Open Access A projective splitting algorithm for solving generalized mixed variational inequalities Fu-quan Xia 1* and Yun-zhi Zou 2 * Correspondence: fuquanxia@sina. com 1 Department...

Ngày tải lên: 21/06/2014, 01:20

... “Perturbed Ishikawa iterative algorithm and stability for nonlinear mixed quasi-variational inclusions involving A, η-accretive mappings,” Advances in Nonlinear Variational Inequalities, vol. ... operator technique for generalized implicit variational-like inclusion in Banach space,” Journal of Mathematical Analysis and Applications, vol. 361, no. 2, pp. 283–292, 2010. 8 R. U. Verma, A ... is a constant. Remark 2.3. The A, η-accretive mappings are more general than H, η-monotone mappings and m-accretive mappings in Banach space or Hilbert space, and the resolvent operators associated...

Ngày tải lên: 21/06/2014, 05:20

... 1, Article ID 015015, 8 pages, 2008. 6 F. Cianciaruso, G. Marino, L. Muglia, and Y. Yao, “On a two-step algorithm for hierarchical fixed point problems and variational inequalities,” Journal ... problems, for example, mathematical program and hierarchical minimization problems as special cases. For solving HEVP, we propose a double-net algorithm which generates a net {x s,t }. We prove that ... variational inequality problem studied by Yamada and Ogura 10, mathematical program studied by Luo et al. 11, hierarchical minimization problem considered by Cabot 12 and Solodov 13, as...

Ngày tải lên: 21/06/2014, 07:20

Ngày tải lên: 21/06/2014, 07:20

Ngày tải lên: 21/06/2014, 08:20

Ngày tải lên: 21/06/2014, 20:20

Ngày tải lên: 22/06/2014, 11:20

Ngày tải lên: 22/06/2014, 19:20

Ngày tải lên: 22/06/2014, 19:20

Ngày tải lên: 22/06/2014, 23:20

Ngày tải lên: 23/06/2014, 01:20

Ngày tải lên: 27/06/2014, 23:20

Ngày tải lên: 11/07/2014, 21:20

... AND ITS IMPLEMENTATION Toshikazu Fukushima, Yutaka Ohyama and Hitoshi Miyai C&C Systems Research Laboratories, NEC Corporation 1-1, Miyazaki 4-chome, Miyamae-ku, Kawasaki City, Kanagawa ... developing natural lan- guage parsing accelerators, a hardware approach to the parsing speed-up (Fukushima, 1989b) -(Fukushima, 199 0a) . This paper describes a new hardware algorithm for high speed ... ha~d, Fukushima's ~Igorithm is very suitable for text with a large character set, such as Japanese (more than 5,000 different chaxacters are com- puter re~able in Japanese). This algorithm...

Ngày tải lên: 21/02/2014, 20:20

... related operation called the Fourier Transformation) is one of the things that makes quantum mechanical algorithms more pow- erful than classical algorithms and forms the basis for most significant ... 4 state system is of the form: , where and are arbitrary real numbers. Note that, unlike the Walsh-Hadamard transformation and other state transition matrices, the probability in each state stays ... = Pv v Dv v i – 2A+ ( ) A A v i –( )+( ) 1 N N 1–( ) 2C 2 N A B C D A B C D Average (α) Average (α) (before) (after) (before) (after) Average Average 2 ence, it is natural to ask - how fast can the basic...

Ngày tải lên: 30/03/2014, 13:20

... connection matrix as its input parameter includes following steps: 1. An arbitrary node (for example node a) is selected as start node. 2. A not search node adjacent to node a (for example node ... 1468617151, Iran (email: nmoslemi@nri.ac.ir , jabbasi@nri.ac.ir) A. Rabiee is with the Department of Electrical Engineering, IUST University, Tehran, Iran (email: Abdorezarabiee@yahooo.com) programming ... reliability block diagram, series-parallel simplification cannot be used and other algorithms should be searched in such cases. Some of these algorithms, which are based on finding minimum paths,...

Ngày tải lên: 03/01/2014, 19:35