Dependency Tree Abstraction for Long-Distance Reordering in Statistical Machine Translation

Word reordering is a crucial technique in statistical machine translation in which syntactic information plays an important role. Synchronous context-free grammar has typically been used for this purpose with various modifications for adding flexibilities to its synchronized tree generation. We permit further flexibilities in the synchronous context-free grammar in order to translate between languages with drastically different word order. Our method pre-processes a parallel corpus by

Paper

Full text

PDF

Dependency Tree Abstraction for Long-Distance Reordering in Statistical Machine Translation

Semantic Scholar · Computer Science · 2014

Abstract

Word reordering is a crucial technique in statistical machine translation in which syntactic information plays an important role. Synchronous context-free grammar has typically been used for this purpose with various modifications for adding flexibilities to its synchronized tree generation. We permit further flexibilities in the synchronous context-free grammar in order to translate between languages with drastically different word order. Our method pre-processes a parallel corpus by

References (41)

Scroll for more · 29 remaining

Similar papers

© 2026 NYSGPT2525 LLC