Dual decomposition for parsing with non-projective head automata

Dual decomposition for parsing with non-projective head automata

This paper introduces algorithms for non-projective parsing based on dual decomposition. We focus on parsing algorithms for non-projective head automata, a generalization of head-automata models to non-projective structures. The dual decomposition algorithms are simple and efficient, relying on stan...

Full description

Bibliographic Details
Main Authors: Koo, Terry, Rush, Alexander Matthew, Collins, Michael, Jaakkola, Tommi S., Sontag, David Alexander
Other Authors: Massachusetts Institute of Technology. Computer Science and Artificial Intelligence Laboratory
Format: Article
Language:en_US
Published: Association for Computational Linguistics 2011
Online Access:http://hdl.handle.net/1721.1/67290
https://orcid.org/0000-0002-2199-0379

Internet

http://hdl.handle.net/1721.1/67290
https://orcid.org/0000-0002-2199-0379

Similar Items