Exact Decoding of Syntactic Translation Models through Lagrangian Relaxation

We describe an exact decoding algorithm for syntax-based statistical translation. The approach uses Lagrangian relaxation to decompose the decoding problem into tractable subproblems, thereby avoiding exhaustive dynamic programming. The method recovers exact solutions, with certificates of optimality, on over 97% of test examples; it has comparable speed to state-of-the-art decoders.

• Type: Journal
• Year: 2011
• Where: ACL
• Authors: Alexander M. Rush, Michael Collins
• Keywords: ACL 2011, Computational Linguistics, Dynamic Programming, Exact Solutions, Test Examples