On dual decomposition and linear programming relaxations for natural language processing

On dual decomposition and linear programming relaxations for natural language processing

This paper introduces dual decomposition as a framework for deriving inference algorithms for NLP problems. The approach relies on standard dynamic-programming algorithms as oracle solvers for sub-problems, together with a simple method for forcing agreement between the different oracles. The approa...

Full description

Bibliographic Details
Main Authors: Rush, Alexander Matthew (Contributor), Sontag, David Alexander (Contributor), Collins, Michael (Contributor), Jaakkola, Tommi S. (Contributor)
Other Authors: Massachusetts Institute of Technology. Computer Science and Artificial Intelligence Laboratory (Contributor), Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science (Contributor)
Format: Article
Language:English
Published: Association for Computational Linguistics, 2011-05-18T20:44:45Z.
Subjects:
Article
Online Access:Get fulltext

Internet

Get fulltext

Similar Items