Abstract
We develop admissible A* search heuristics for synchronous parsing with Inversion Transduction Grammar, and present results both for bitext alignment and for machine translation decoding. We also combine the dynamic programming hook trick with A* search for decoding. These techniques make it possible to find optimal alignments much more quickly, and make it possible to find optimal translations for the first time. Even in the presence of pruning, we are able to achieve higher BLEU scores with the same amount of computation. ©2006 Association for Computational Linguistics.
Cite
CITATION STYLE
Zhang, H., & Gildea, D. (2006). Efficient search for Inversion Transduction Grammar. In COLING/ACL 2006 - EMNLP 2006: 2006 Conference on Empirical Methods in Natural Language Processing, Proceedings of the Conference (pp. 224–231). Association for Computational Linguistics (ACL). https://doi.org/10.3115/1610075.1610109
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
