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...
| Main Authors: | , , , |
|---|---|
| Other Authors: | |
| Format: | Article |
| Language: | en_US |
| Published: |
Association for Computational Linguistics
2011
|
| Online Access: | http://hdl.handle.net/1721.1/62836 https://orcid.org/0000-0002-2199-0379 |