Báo cáo khoa học: "Enriching Morphologically Poor Languages for Statistical Machine Translation" doc

... 763–770, Columbus, Ohio, USA, June 2008. c 2008 Association for Computational Linguistics Enriching Morphologically Poor Languages for Statistical Machine Translation Eleftherios Avramidis e.avramidis@sms.ed.ac.uk Philipp ... Koehn pkoehn@inf.ed.ac.uk School of Informatics University of Edinburgh 2 Baccleuch Place Edinburgh, EH8 9LW, UK Abstract We address the problem of transl...

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

... experimental results for a bilingual cor- pus are reported. 1.1 Statistical Machine Translation In statistical machine translation, the goal of the search strategy can be formulated as follows: ... additional parameter into the recursion formula for DP. In the following, we will explain this method in detail. 2.3 Recursion Formula for DP In the DP formalism, the search...

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

... ACL, pages 557–564, Ann Arbor, June 2005. c 2005 Association for Computational Linguistics A Localized Prediction Model for Statistical Machine Translation Christoph Tillmann and Tong Zhang IBM ... @us.ibm.com Abstract In this paper, we present a novel training method for a localized phrase-based predic- tion model for statistical machine translation (SMT). The model predicts...

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

... Refined Lexicon Models for Statistical Machine Translation using a Maximum Entropy Approach Ismael Garc ´ ıa Varea Dpto. de Inform´atica Univ. de Castilla-La Mancha Campus ... the lexicon models used in statistical machine translation systems do not include any kind of linguistic or contextual information, which often leads to problems in performing a cor- rect word ... this problem...

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

... 72–80, Columbus, Ohio, USA, June 2008. c 2008 Association for Computational Linguistics Cohesive Phrase-based Decoding for Statistical Machine Translation Colin Cherry ∗ Microsoft Research One ... all such subtrees for a hypothetical T and ¯ f h 1 . Fortunately, with a little analysis that ac- counts for ¯ f h+1 , we can show that at most two sub- trees need to be checked. For...

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

... Sessions, pages 177–180, Prague, June 2007. c 2007 Association for Computational Linguistics Moses: Open Source Toolkit for Statistical Machine Translation Philipp Koehn Hieu Hoang Alexandra ... sta- tistical machine translation whose novel contributions are (a) support for linguisti- cally motivated factors, (b) confusion net- work decoding, and (c) efficient data for- m...

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

... is defined as the ratio of tokens from A for which a translation appears in document B in a nearby po- sition. The document with the highest similarity is selected. For the Xinhua News corpus less then 2% ... also from noisy comparable corpora. Translation results for a Chinese to En- glish translation task are given. 1 Introduction Statistical machine translation systems typically...

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

... because can it they we that can can can be be have be have be have it it has forgotten has forgotten has has forgotten forgotten been forgotten been forgotten forgotten . . forgotten . . . . . . Figure 1: Example of a translation ... amount of papers investigating new approaches to language modeling for statis- tical machine translation. Traditionally, statistical machine translation...

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

... polynomial-time algorithm for statistical machine translation. This algorithm can be used in place of the expensive, slow best-first search strate- gies in current statistical translation ar- ... that exploits bracket- ing information (Wu and Ng, 1995). If any brackets for the Chinese sentence can be supplied as addi- tional input information, produced for example by a prepr...

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

... partitionings of forms. Secondly, the compi- lation of such languages into finite-state machines has been exhaustively studied. Their closure prop- erties provide operations useful for morphological purposes. They ... imply any change of the user-level formalisms, thanks to a straightforward homomorphism from partitioned n-relations to Mazurkiewicz Trace Languages. 2 Mazurkiewicz Trace...

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