[PDF] Top 20 A Polynomial Time Algorithm for Statistical Machine Translation

... The approach employs the stochastic bracketing transduction grammar SBTG model we recently introduced to replace earlier word alignment channel models, while retaining a bigram language [r] ... See full document

... Nowadays statistical machine translation shows its benefits and has received much ...phrase-based statistical machine translation was carefully ...better. Translation ... See full document

... our algorithm over other three systems is that it does not require any prior knowledge of the NL ...this algorithm to other NL sentences for which train- ing data is ... See full document

... to translation error modification by build- ing a meta-level SMT using a meta-level corpus that is created form original corpus by cross vali- ...many translation errors that occur in the baseline ... See full document

... the translation direction English to German, the word reordering can be restricted in a similar way as for the translation direction German to ...the translation process, the English verb group is ... See full document

... A DP based Search Algorithm for Statistical Machine Translation A D P b a s e d S e a r c h A l g o r i t h m for S t a t i s t i c a l M a c h i n e T r a n s l a t i o n S N i e f l e n , S Vogel, H[.] ... See full document

... In order to overcome these limitations, we pro- pose an iterative refinement procedure based on backtranslation (Sennrich et al., 2016). More con- cretely, we generate a synthetic parallel corpus by translating the ... See full document

... The purpose of this paper is to describe speed improve- ments to the greedy decoder mentioned above. While ac- ceptably fast for the kind of evaluation used in Germann et al. (2001), namely sentences of up to 20 words, ... See full document

... both translation and evaluation. At translation time, domain adaptation techniques increase the likelihood of correct translations on average, but they do not provide the MT system with any inform- ... See full document

... However, for the optimization criterion considered here dynamic programming is only suboptimal because the decomposition into independent subproblems is only approximately possible: to p[r] ... See full document

... 1999). Therefore, we have to restrict the possible reorderings in some way to make the search prob- lem feasible. Here, we will discuss two such con- straints in detail. The first constraints are based on inversion ... See full document

... modern statistical machine translation systems are based on linear statistical ...in machine translation. We describe a polynomial-time generalisation of line ... See full document

... Figure 7 is only an architecture. Computational complexity and generalization error stand in the way of its practical implementation. Nevertheless, it is satisfying to note that all the non-trivial algo- rithms in Figure ... See full document

... of machine translation is greatly improved by applying neural networks par- tially in a Statistical Machine Translation (SMT) pipeline (Zou et ...based machine translation ... See full document

... the translation model consisting of mil- lions of features are successfully ...training algorithm is applicable to any translation systems, such as phrase-based trans- lations and syntax-based ... 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

... in statistical parsing: Nivre and McDonald (2008) integrated two models for dependency parsing by letting one model learn from features generated by the other; ...stacking algorithm and improved on Nivre ... See full document

... cannot be computed for all blocks in the training data: we would obtain hundreds of millions of blocks. The blocks are restricted by an underlying word alignment. In this paper, we present a block generation ... See full document

... The statistics for the ParFDA selected training data and the available training data for the con- strained translation task are given in Table 1. For en and fr, we have access to the LDC Gigaword corpora (Parker ... See full document

... Czech translation of the Penn Wall Street Journal corpus, provided reference translations for test- ing and the target-language side of the parallel corpus for ... See full document