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 (Contributor), Rush, Alexander Matthew (Contributor), Collins, Michael (Contributor), Jaakkola, Tommi S. (Contributor), Sontag, David Alexander (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-11-22T14:20:51Z.
Subjects:
Article
Online Access:Get fulltext

Internet

Get fulltext

Similar Items