Accelerated DP based search for statistical translation

By Christoph Tillmann, Stephan Vogel, Hermann Ney, Arkaitz Zubiaga, H. Sawaf. 1997

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 e(cid:11)ort for this approach, we introduce two methods: an acceleration technique to e(cid:14)ciently 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 a(cid:11)ecting the translation performance.

Subfields: Natural Language Processing, Optimization & Training

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

In Natural Language Processing

  1. Ondrej Bojar
  2. Philipp Koehn
  3. Lucia Specia
  4. Graham Neubig
  5. Luke S. Zettlemoyer
  6. Barry Haddow
  7. Matt Post
  8. Noah A. Smith

In Optimization & Training

  1. Philipp Koehn
  2. Ondrej Bojar
  3. Hermann Ney
  4. Nicola Ueffing
  5. Christian Federmann
  6. Marco Turchi
  7. Matteo Negri
  8. Ales Tamchyna

Citations in the corpus