Efficient Dynamic Programming Search Algorithms for Phrase-Based SMT

HLT-NAACL 2006 - Computationally Hard Problems and Joint Inference in Speech and Language Processing, Proceedings of the Workshop

Volumn , Issue , 2006, Pages 9-16

  Tillmann, Christoph ^a  

^a IBM T J WATSON RESEARCH CENTER   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL EFFICIENCY; COMPUTATIONAL LINGUISTICS; COMPUTER AIDED LANGUAGE TRANSLATION; DECODING; MACHINE TRANSLATION; SPEECH RECOGNITION; SPEECH TRANSMISSION;

ALIGNMENT ALGORITHMS; DECODING ALGORITHM; PATH-FINDING ALGORITHMS; PHRASE-BASED STATISTICAL MACHINE TRANSLATION; PRUNING STRATEGY; SEARCH ALGORITHMS; SHORTEST PATH FINDINGS; STATISTICAL MACHINE TRANSLATION; TRANSLATION SPEED; WORD ALIGNMENT;

DYNAMIC PROGRAMMING;

EID: 34547367518     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (19)

1. Yaser Al-Onaizan, Niyu Ge, Young-Suk Lee, Kishore Papineni, Fei Xia, and Christoph Tillmann. 2004. IBM Site Report. In NIST 2004 MT Workshop, Alexandria, VA, June. IBM.
2. Adam L. Berger, Peter F. Brown, Stephen A. Della Pietra, Vincent J. Della Pietra, Andrew S. Kehler, and Robert L. Mercer. 1996. Language Translation Apparatus and Method of Using Context-Based Translation Models. United States Patent, Patent Number 5510981, April.
3. Peter F. Brown, Vincent J. Della Pietra, Stephen A. Della Pietra, and Robert L. Mercer. 1993. The Mathematics of Statistical Machine Translation: Parameter Estimation. Computational Linguistics, 19(2):263-311.
4. Thomas H. Cormen, Charles E. Leiserson, Ronald L. Rivest, and Clifford Stein. 2001. Introduction to Algorithms. MIT Press, Cambridge Massachusetts.
5. Stuart E. Dreyfus and Averill M. Law. 1977. The Art and Theory of Dynamic Programming (Mathematics in Science and Engineering; vol. 130). Acadamic Press, New York, N.Y.
6. Held and Karp. 1962. A Dynamic Programming Approach to Sequencing Problems. SIAM, 10(1):196-210.
7. Fred Jelinek. 1998. Statistical Methods for Speech Recognition. The MIT Press, Cambridge, MA.
8. Kevin Knight. 1999. Decoding Complexity in Word-Replacement Translation Models. CL, 25(4):607-615.
9. Philipp Koehn. 2004. Pharaoh: a Beam Search Decoder for Phrase-Based Statistical Machine Translation Models. In Proceedings of AMTA 2004, Washington DC, September-October.
10. Bruce Lowerre and Raj Reddy. 1980. The Harpy speech understanding system, in Trends in Speech Recognition, W.A. Lea, Ed. Prentice Hall, EngleWood Cliffs, NJ.
11. H. Ney, D. Mergel, A. Noll, and A. Paeseler. 1992. Data Driven Search Organization for Continuous Speech Recognition in the SPICOS System. IEEE Transaction on Signal Processing, 40(2):272-281.
12. S. Niessen, S. Vogel, H. Ney, and C. Tillmann. 1998. A DP-Based Search Algorithm for Statistical Machine Translation. In Proc. of ACL/COLING 98, pages 960-967, Montreal, Canada, August.
13. Franz-Josef Och and Hermann Ney. 2004. The Alignment Template Approach to Statistical Machine Translation. Computational Linguistics, 30(4):417-450.
14. Franz Josef Och. 2003. Minimum error rate training in statistical machine translation. In Proceedings of ACL'03, pages 160-167, Sapporo, Japan.
15. Christoph Tillmann and Hermann Ney. 2003. Word Reordering and a DP Beam Search Algorithm for Statistical Machine Translation. CL, 29(1):97-133.
16. Christoph Tillmann, Stefan Vogel, Hermann Ney, and Alex Zubiaga. 1997. A DP-based Search Using Monotone Alignments in Statistical Translation. In Proc. of ACL 97, pages 289-296, Madrid,Spain, July.
17. Christoph Tillmann. 2001. Word Re-Ordering and Dynamic Programming based Search Algorithm for Statistical Machine Translation. Ph.D. thesis, University of Technology, Aachen, Germany.
18. Christoph Tillmann. 2003. A Projection Extension Algorithm for Statistical Machine Translation. In Proc. of EMNLP 03, pages 1-8, Sapporo, Japan, July.
19. Dekai Wu. 1997. Stochastic Inversion Transduction Grammars and Bilingual Parsing of Parallel Corpora. Computational Linguistics, 23(3):377-403.