Phrase based Machine Translation using Multiple Preordering Candidates
In this paper, we propose a new decoding method for phrase based statistical machine translation which directly uses multiple preordering candidates as a graph structure. Compared with previous phrase based decoding methods, our method is based on a simple left to right dynamic programming in which no decoding time reordering is performed. As a result, its runtime is very fast and implementing the algorithm becomes easy. Our system does not depend on specific preordering methods as long as they output multiple preordering candidates, and it is trivial to employ existing preordering methods into our system. In our experiments for translating diverse 11 languages into English, the proposed method outperforms conventional phrase based decoder in terms of translation qualities under comparable or faster decoding time.
COLING