[PDF] Top 20 Phrase-Based Machine Translation based on Simulated Annealing

... The first column presents French sequences of one or sev- eral words. Sequences that have more than one word are automatically picked up by the iterative process explained in section (2.3.1.). For each French sequence, ... See full document

... Prediction of morph boundary types has been used in conjunction with compound splitting. Stymne and Cancedda (2011) apply rule-based compound splitting in the pre-processing stage, and a conditional random field ... See full document

... idiomatic phrase translations and can be easily enriched with bilingual ...using phrase-based translation in a statistical framework has been shown in many studies such as (Koehn et ...the ... See full document

... the machine translation ...generalized translation of out-of-vocabulary (OOV) words to overcome sparsity of training data and (iii) replace arbitrary limits with linguistics constraints put in place ... See full document

... statistical machine translation (SMT) and translation memory (TM) complement each other in matched and unmatched regions, integrated models are proposed in this paper to incorporate TM information ... 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

... This state of affairs has prompted some to ex- amine the possibility of automating the post-editing process itself, at least as far as “repetitive errors” are concerned. Allen and Hogan (2000) sketch the out- line of ... See full document

... the translation speed of the phrase-based translation ...the translation times. The translation speed of the monotone phrase-based system for all three tasks is ... See full document

... In order to derive the morphological decompo- sition we use existing tools. For stemming we use the TreeTagger (Schmid, 1994) for German and the Snowball stemmer 1 for Finnish. A vari- ety of ways for compound splitting ... See full document

... standard phrase table is extracted using parallel training data, we propose to extend it and infer new entries relying on continuous representa- ...new phrase pair can be generated by re- placing either or ... See full document

... the phrase level, these models typically have a simple distortion model that reorders phrases in- dependently of their content (Och and Ney, 2004; Koehn et ... See full document

... investigate unbiased sampling in addition to op- timisation. However, they start from a coarser upperbound with unigram probabilities, and their refinement strategies are based on exhaustive in- tersections with ... See full document

... the ITG reorderings, we see that the ITG system always outperforms the unconstrained system. The improvement on the whole test set is statistically significant at the 95% level. 1 In Table 5 and Table 6, we show the re- ... See full document

... the translation probabilities of connecting phrases from out-of-domain corpus are estimated by real corpus ...their translation probabil- ities, which may be useful in decoding, into in-domain bilingual ... See full document

... In contrast, the delayed pruning not only avoids search errors but also provides a dynamically man- ageable search space (refer section 4.2.2) by re- taining the best of the potential candidates. In a practical scenario ... See full document

... our phrase table and lan- guage model supports a literal translation, cohesion tends to produce an ...first translation example shown in Table 5. In the base- line translation, the language ... See full document

... ginning. Generating the target in the ‘wrong’ di- rection (the opposite direction to the way in which humans do) is counter intuitive, and possibly as a result of this, SMT systems typically generate the target word ... See full document

... English with large distance reorderings between phrases are more prone to search errors and benefit more from our pruning algorithm. To illustrate this, let us consider the source sentence “John married in Portugal”, and ... See full document

... to Phrase Embeddings State of the art Phrase Based UMT systems ( Lam- ple et ...learn phrase embeddings as individ- ual vocabulary entries (to form the entry, we just concatenate words ... See full document

... a phrase pair ex- traction procedure is the resulting phrase transla- tion table is very large, especially when a large quantity of parallel data is ...some phrase translation pairs are ... See full document