[PDF] Top 20 Bidirectional Decoding for Statistical Machine Translation

... Japanese translation, and the right-to-left decoding method was slightly superior to the left-to-right one in terms of WER/PER scores, though the SE score dropped from ...the bidirectional method in ... See full document

... statistial machine translation ...phrase-based machine translation de- coder using a left-to-right decoding strat- egy to a right-to-left ...tional decoding strategy that ... See full document

... Secondly, from the swapping experiment we conclude that except for very local word reorderings, neither the IBM models nor the BLEU metric are able to recognize long distance dependencies (such as, for example, ac- ... See full document

... LM score computations are among the most expen- sive in decoding. Delaney et al. (2006) report signif- icant improvements in runtime by removing unnec- essary LM lookups via early pruning. Here we de- scribe an LM ... See full document

... and translation fluency for the current state-of-the-art SMT systems based on IBM models are still too low for publication ...stack decoding process, may not strictly follow the natural target language ... See full document

... and bidirectional decoding (Liu et ...agent decoding from left to right (L2R) while the other decoding in opposite direction ...the translation models by introducing a regularization ... See full document

... SMT decoding (Germann et ...sentence-level decoding employed a steepest as- cent strategy which amounts to enumerating the complete neighbourhood of the current state as de- fined by the state operations ... See full document

... It is easy to determine the optimal (Viterbi) alignment between the source sentence and its translation. In fact, for IBM models 1 and 2, the Viterbi alignment can be computed using a straight forward algorithm in ... See full document

... Table 1 gives some examples of the inflected forms of a person name and its corresponding English meaning. The Manipuri stemmer sepa- rates the case markers such as – নো (-na), - দগী (- dagi), - সু (-su), - গী (-gi), - ... See full document

... Some approaches have applied WFST to sta- tistical machine translation. Knight and Al- Onaizan (1998) proposed the representation of IBM model 3 with WFSTs; Bangalore and Ric- cardi (2001) studied WFST ... See full document

... This section describes one implementation of the transformation function Ψ that we will show leads to improved fluency of machine translation out- put. This transformation is based on n-gram cov- erage in a ... See full document

... good decoding algorithm is critical to the success of any statistical machine translation ...the translation that is most likely according to set of previously learned parameters (and a ... See full document

... The IN configuration, which puts in a trans- lation table all bi-phrases in the one-best hy- pothesis of Rerank that do not belong to the Moses one-best hypothesis, performs the best for all translation tasks: ... See full document

... in statistical machine translation, including the phrase-based model, the hierachical phrase-based model, and various syntax- based ...of decoding algrithms, such as phrase-based ... See full document

... Evaluation exercises indicate that approximate search algorithms work well in practice (Bojar et al., 2013). The most popular algorithms pro- vide solutions with unbounded error, thus pre- cisely quantifying their ... See full document

... Consensus decoding, on the other hand, can be based on either single or multiple systems: single system based methods (Kumar and Byrne, 2004; Tromble et ... See full document

... the decoding procedure do affect the translation performance, there are con- cerns that the logistic relationship between decod- ing features and specific translation errors is very large, so that ... See full document

... Already at (14), we explicitly ruled out translations y having no derivation at all in the hypergraph. However, suppose the hypergraph were very large (thanks to a large or smoothed translation model and weak ... See full document

... Table 2: Examples of Correct, Okay, and Incorrect Translations: for each translation, the first line is an input German sentence, the second line is the human made target translation for[r] ... 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