Fast and optimal decoding for machine translation

https://doi.org/10.1016/j.artint.2003.06.001Get rights and content
Under an Elsevier user license
open archive

Abstract

A good decoding algorithm is critical to the success of any statistical machine translation system. The decoder's job is to find the translation that is most likely according to a set of previously learned parameters (and a formula for combining them). Since the space of possible translations is extremely large, typical decoding algorithms are only able to examine a portion of it, thus risking to miss good solutions. Unfortunately, examining more of the space leads to unacceptably slow decodings.

In this paper, we compare the speed and output quality of a traditional stack-based decoding algorithm with two new decoders: a fast but non-optimal greedy decoder and a slow but optimal decoder that treats decoding as an integer-programming optimization problem.

Keywords

Statistical machine translation
Machine translation
Decoding
SMT
MT

Cited by (0)

This is an extended version of our paper, “Fast and Optimal Decoding for Machine Translation”, which received a Best Paper Award at the 39th Annual Meeting of the Association for Computational Linguistics (ACL-2001).