Báo cáo khoa học: "Pattern-Based Context-Free Grammars for Machine Translation" pot

... N for i = 1; i ≤ M; i = i +1 do for j = 1; j ≤ N; j = j +1 do for k = 1; k ≤ i; k = k +1 do for m = 1; m ≤ j; m = m +1 do score i,j,k,m = max{score i−1,j,k,m ,score i,j−1,k,m } ; end for end for score i,j,i,j = max n=1,M;p=1,N {score i,j,i,j , ... |ref|; for i = 1; i ≤ M; i = i +1 do for j = 1; j ≤ N; j = j +1 do for k = 1; k ≤ i; k = k +1 do for m = 1; m ≤ j; m = m +1 do...

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

... kinds of information extracted from the Input: The samples  o, φ( ¯ f j , ¯e i )  N n=1 , step size η Initialization: k = 0; w o,k = 0 ∀o ∈ Ω; Repeat for n = 1, 2, . . . , N do for o  = o ... ME model, which implies a potential benefit of struc- ture learning. Figure 2 further demonstrate the av- erage accuracy for each reordering distance d. It shows that even for long distance re...

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

... 969–976, Sydney, July 2006. c 2006 Association for Computational Linguistics Modelling lexical redundancy for machine translation David Talbot and Miles Osborne School of Informatics, University of Edinburgh 2 ... be re-enforced across the model. For instance (see Fig. 1), if cymru and gymru are clustered to- gether, the parameter for feature ψ 1 , shown above, may increase. This i...

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

... framework, it is straightforward to encode the morphological properties of a word, in addition to its surface inflected form. For example, for a particular inflected word form y t and its con- text, ... USA hisamis@microsoft.com Abstract We present a novel method for predicting in- flected word forms for generating morpho- logically rich languages in machine trans- lation. We utilize a...

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

... B LEU: a Method for Au- tomatic Evaluation of Machine Translation. In Proc. of ACL’02, 311–318. Michael Pozar and Eugene Charniak. 2006. Bllip: An Improved Evaluation Metric for Machine Translation. ... the Association for Computational Linguistics, pages 108–117, Uppsala, Sweden, 11-16 July 2010. c 2010 Association for Computational Linguistics Automatic Evaluation Method for...

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

... translation performance obtained by the training phase. 2 For decoding, we prohib- ited Moses form performing character reordering (distortion). While reordering may be needed for translation, ... The system’s overall accuracy is about 72% for top-1 results and 84% for top-20 results. This method is restricted to transliterating NEs, and performs best for person names. As noted abov...

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

... Phrase-based Statistical Machine Translation (PBSMT) with syntactic structure caused system per- formance to deteriorate. In this work we show that incorporating lexical syntactic de- scriptions in the form of ... allows for control over the length of the target sentence t: arg max φ t ,O t  P (φ s | φ t ) P(O s | O t ) λ o P w (t) λ lm exp |t|λ w For convenience of notation, the inte...

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

... sub-parse. For example, see the rule 962 FORM → state , λx 1 .state(x 1 ) FORM → by area , λx 1 .λx 2 .area(x 1 ,x 2 ) FORM → smallest FORM 1 FORM 2 , λx 1 .smallest(x 2 ,(FORM 1 (x 1 ),FORM 2 (x 1 , ... logical forms in the GEOQUERY domain and their English glosses. (a) smallest(x 2 ,(FORM,FORM)) QUERY answer(x 1 ,FORM) area(x 1 ,x 2 )state(x 1 ) (b) λx 1 .smallest(x 2 ,(FORM(x 1 ),FO...

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

... checked for minimality during a second. Since update-node is a general mechanism for adding or modifying information to a node on the basis of c-commanding constituents it is fairly straightforward ... algorithm explicitly indicates the potential antecedents of a personal pronoun. Again, this is more desirable than leaving this information implicit; besides the potential (and perha...

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

... Association for Computational Linguistics, pages 1006–1014, Jeju, Republic of Korea, 8-14 July 2012. c 2012 Association for Computational Linguistics Combining Coherence Models and Machine Translation ... are also evaluated for their ability to assess sum- mary readability, i.e., to measure how linguistically readable a machine generated summary is. Sub- mitted metrics that perform...

Ngày tải lên: 07/03/2014, 18:20