Word Re-ordering and DP-based Search in Statistical Machine Translation (2000)
| Venue: | In Proc. of the COLING 2000, JulyAugust |
| Citations: | 14 - 1 self |
BibTeX
@INPROCEEDINGS{Tillmann00wordre-ordering,
author = {Christoph Tillmann and Hermann Ney},
title = {Word Re-ordering and DP-based Search in Statistical Machine Translation},
booktitle = {In Proc. of the COLING 2000, JulyAugust},
year = {2000},
pages = {850--856}
}
Years of Citing Articles
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
In this paper, we describe a search procedure for statistical machine translation (MT) based on dynamic 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 ecient search algorithm. A search restriction especially useful for the translation direction from German to English is presented. The experimental tests are carried out on the Verbmobil task (German-English, 8000-word vocabulary), which is a limited-domain spoken-language task. 1 Introduction The goal of machine translation is the translation of a text given in some source language into a target language. We are given a source string f J 1 = f 1 :::f j :::f J of length J , which is to be translated into a target string e I 1 = e 1 :::e i :::e I of length I . Among all possible target strings, we will choose the string with the highest probability: ^ e I 1 = arg m...
Citations
No citations identified.
