Reordering Model for Forest-to-String Machine Translation
Code (0)
등록된 구현이 없습니다.
Tasks
Machine TranslationmodelTranslationSimilar Papers 제목 키워드 기반
Two-Step Machine Translation with Lattices
The idea of two-step machine translation was introduced to divide the complexity of the search space into two independent steps: (1) lexical translation and reordering, and (2) conjugation and declination in the target l…
Language ModellingLemmatizationMachine TranslationTranslation+1Bayesian Synchronous Grammar Induction
We present a novel method for inducing synchronous context free grammars (SCFGs) from a corpus of parallel string pairs. SCFGs can model equivalence between strings in terms of substitutions, insertions and deletions, an…
Machine TranslationTranslationA Survey of Word Reordering in Statistical Machine Translation: Computational Models and Language Phenomena
Word reordering is one of the most difficult aspects of statistical machine translation (SMT), and an important factor of its quality and efficiency. Despite the vast amount of research published to date, the interest of…
Machine TranslationTranslationTowards String-to-Tree Neural Machine Translation
We present a simple method to incorporate syntactic information about the target language in a neural machine translation system by translating into linearized, lexicalized constituency trees. An experiment on the WMT16 …
Machine TranslationNMTTranslationIncorporating Syntactic Uncertainty in Neural Machine Translation with a Forest-to-Sequence Model
Incorporating syntactic information in Neural Machine Translation (NMT) can lead to better reorderings, particularly useful when the language pairs are syntactically highly divergent or when the training bitext is not la…
Machine TranslationNMTSentenceTranslation