In this paper, we describe a fast search algorithm for statistical translation based on dynamic programming (DP) and present experimental results. The approach is based on the assumption that the word alignment is monotone with respect to the word order in both languages. To reduce the search effort for this approach, we introduce two methods: an acceleration technique to eficiently compute the dynamic programming recursion equation and a beam search strategy as used in speech recognition. The experimental tests carried out on the Verbmobil corpus showed that the search space, measured by the number of translation hypotheses, is reduced by a factor of about 230 without affecting the translation performance.
Cite as: Tillmann, C., Vogel, S., Ney, H., Zubiaga, A., Sawaf, H. (1997) Accelerated DP based search for statistical translation. Proc. 5th European Conference on Speech Communication and Technology (Eurospeech 1997), 2667-2670, doi: 10.21437/Eurospeech.1997-673
@inproceedings{tillmann97_eurospeech,
author={C. Tillmann and S. Vogel and Hermann Ney and A. Zubiaga and H. Sawaf},
title={{Accelerated DP based search for statistical translation}},
year=1997,
booktitle={Proc. 5th European Conference on Speech Communication and Technology (Eurospeech 1997)},
pages={2667--2670},
doi={10.21437/Eurospeech.1997-673}
}