Word Re-ordering and DP-based Search in Statistical Machine Translation

In this paper, we describe a search procedure for statistical machine translation (MT) based on dynmnic programming (DP). Starting from a DP-based solution to the traveling salesman problem, we present a novel technique to restrict the possible word reordering between source and target language in order to achieve an efficient search algorithm. A search restriction especially useful for tile translation direction from German to English is presented. The experimental tests are carried out on the Verbmobil task (Germm>English, 8000-word vocabulary), which is a limited-domain spoken-language task.

• Type: Conference
• Year: 2000
• Where: COLING
• Authors: Christoph Tillmann, Hermann Ney
• Keywords: COLING 2000, COLING 2008, Efficient Search Algorithm, Statistical Machine Translation, Traveling Salesman Problem