Abstract
This paper revisits optimal decoding for statistical machine translation using IBM Model 4. We show that exact/optimal inference using Integer Linear Programming is more practical than previously suggested when used in conjunction with the Cutting-Plane Algorithm. In our experiments we see that exact inference can provide a gain of up to one BLEU point for sentences of length up to 30 tokens.
Cite
CITATION STYLE
Riedel, S., & Clarke, J. (2009). Revisiting optimal decoding for machine translation IBM model 4. In NAACL-HLT 2009 - Human Language Technologies: 2009 Annual Conference of the North American Chapter of the Association for Computational Linguistics, Short Papers (pp. 5–8). Association for Computational Linguistics (ACL). https://doi.org/10.3115/1620853.1620856
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
