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

ACL ID E14-1045
Title Dependency Tree Abstraction for Long-Distance Reordering in Statistical Machine Translation
Venue Annual Meeting of The European Chapter of The Association of Computational Linguistics
Session Main Conference
Year 2014
Authors

Dependency Tree Abstraction for Long-Distance Reordering in Statistical Machine Translation Chenchen Ding Department of Computer Science University of Tsukuba 1-1-1 Tennodai, Tsukuba, Ibaraki , Japan tei@mibel.cs.tsukuba.ac.jp Yuki Arase Microsoft Research No. 5 Danling St., Haidian Dist. Beijing, P.R. China yukiar@microsoft.com Abstract Word reordering is a crucial technique in statistical machine translation in which syntactic information plays an important role. Synchronous context-free gram- mar has typically been used for this pur- pose with various modifications for adding flexibilities to its synchronized tree gen- eration. We permit further flexibilities in the synchronous context-free grammar in order to translate between languages with drastically different word order. Our method...