Word reordering and a dynamic programming beam search algorithm for statistical machine translation

DOI10.1162/089120103321337458MaRDI QIDQ3225399zbMATH OpenOpenAlexFDO

Authors Christoph Tillmann, Hermann Ney

Publication date 20 March 2012

Published in Computational Linguistics (Search for Journal in Brave)

Copyright license Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International

Full work available at URL https://doi.org/10.1162/089120103321337458

zbMATH Keywords

beam search algorithmdynamic programmingstatistical machine translationword reordering

Mathematics Subject Classification ID

Natural language processing (68T50) Dynamic programming (90C39)

Recommendations

• Statistical translation of text and speech: First results with the RWTH system
• scientific article; zbMATH DE number 1948986
• The alignment template approach to statistical machine translation
• A systematic comparison of various statistical alignment models
• Structural, Syntactic, and Statistical Pattern Recognition

Cites work

• A Dynamic Programming Approach to Sequencing Problems

Cited in

(7)

• Sequential Monte Carlo for maximum weight subgraphs with application to solving image jigsaw puzzles
• Learning finite-state models for machine translation
• Backtracking and exchange of information: Methods to enhance a beam search algorithm for assembly line scheduling
• The alignment template approach to statistical machine translation
• Structural, Syntactic, and Statistical Pattern Recognition
• Phrase-based correction model for improving handwriting recognition accuracies
• Fast and optimal decoding for machine translation

This page was built for publication: Word reordering and a dynamic programming beam search algorithm for statistical machine translation

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3225399)