[PDF] Top 20 Integrating Translation Memory into Phrase Based Machine Translation during Decoding

... marked or not. Another difference between Ma- 11 and Koehn-10 is how the XML input is con- structed. In constructing the XML input sentence, Ma-11 replaces each matched source phrase in the given source sentence ... See full document

... Philipp Koehn, Hieu Hoang, Alexandra Birch, Chris Callison-Burch, Marcello Federico, Nicola Bertoldi, Brooke Cowan, Wade Shen, Christine Moran, Richard Zens, Chris Dyer, Ondˇrej Bojar, Alexandra Constantin, and Evan ... See full document

... SMT phrase table, TM phrase pairs can be classified into three different categories: (1) the whole TM phrase-pair can be found in the original SMT phrase table; (2) only TM source ... See full document

... neural machine trans- lation (SGNMT), the NMT decoder uses phrase translations produced by the hierarchical phrase- based SMT system Hiero, as hard decoding con- ...SMT ... See full document

... as translation memories into an SMT sys- tem, which yields consistent and significant im- provements over baseline results on IT, legal and patent ...no phrase-segmentation or alignment between TM source and ... See full document

... forced decoding algorithm, which is based on the standard phrase-based decoding algorithm and integrates new types of translation rules (deleting a source word or inserting a ... See full document

... comparing phrase-based and Hiero trans- lation models, most of previous work on tree- based translation addresses its limited hypothesis space ...extend phrase-based trans- ... See full document

... databases, translation memories, machine translation and hu- man ...a translation memory of in- dividual sentence pairs from previously posted ads; another third of all text is ... See full document

... The SMT models for our experiments were cre- ated with a subset of the training data for the English-French shared task at the WMT 2011 work- shop (Callison-Burch et al., 2011). The phrase ta- ble was trained on ... See full document

... in phrase-based statistical machine translation (SMT), aiming at increased effi- ciency of decoding by minimizing the number of language model computations and hypothe- sis ...model ... See full document

... tistical machine translation (SMT). Current phrase-based SMT technologies are good at capturing local reordering but not global ...state-of-the-art phrase-based SMT ... See full document

... of machine translation systems by studying the reference ...forced decoding mode: during search, all hy- potheses that deviate from the reference are simply dis- ...of ... See full document

... Our hope is that syntactic cohesion will help the decoder make smarter distortion decisions. An ex- ample with distortion is shown in Figure 2. In this case, we present two candidate French translations of an English ... See full document

... Beam search (Koehn et al., 2003) and cube prun- ing (Chiang, 2007) are examples of state-of-the-art approximate search algorithms. They approximate the intersection between the translation forest and the language ... See full document

... The results in Table 4 show that the incremen- tal decoder was significantly faster than the beam search in re-decoding mode almost by a factor of 9 in the best case (for Fr-En). The speedup is pri- marily due to ... See full document

... a translation graph ...the decoding space and rerank to select the best translation from this con- strained ...a translation memory instead of a parse tree or word ... See full document

... Beam search (Koehn et al., 2003) and cube prun- ing (Chiang, 2007) are examples of state-of-the-art approximate search algorithms. They approximate the intersection between the translation forest and the language ... See full document

... pronoun-focused translation task at DiscoMT 2015 is a document-level phrase-based statistical ma- chine translation (SMT) system integrating a neu- ral network classifier for pronoun ... See full document

... of phrase pairs and the most likely translation provided by the ...these phrase pairs are included in the training data. The standard Moses phrase table only contains many single word-to-word ... See full document

... shallow-1 decoding using R and X- glue rules achieve the complex movement resulting in a significantly better translation than full-Hiero decoding as shown in the last two lines in Table ... See full document