Dual decomposition for parsing with non-projective head automata
Name
Jaakkola_Dual decomposition.pdf
Size
300.71 KB
Format
Adobe PDF
Checksum (MD5)
c8da2566abc7a523bb3bc67ffc418ce4
Author(s)
Koo, Terry
Rush, Alexander Matthew
Collins, Michael
Jaakkola, Tommi S.
Sontag, David Alexander
Date Issued
October 2010
Journal
Proceedings of the 2010 Conference on Empirical Methods in Natural Language Processing
Publisher
Association for Computational Linguistics
Citation
Terry Koo, Alexander M. Rush, Michael Collins, Tommi Jaakkola, and David Sontag. 2010. Dual decomposition for parsing with non-projective head automata. In Proceedings of the 2010 Conference on Empirical Methods in Natural Language Processing (EMNLP '10). Association for Computational Linguistics, Stroudsburg, PA, USA, 1288-1298.
Version
Author's final manuscript
Abstract
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 standard dynamic programming and minimum spanning tree algorithms. They provably solve an LP relaxation of the non-projective parsing problem. Empirically the LP relaxation is very often tight: for many languages, exact solutions are achieved on over 98% of test sentences. The accuracy of our models is higher than previous work on a broad range of datasets.
MIT Department
Massachusetts Institute of Technology. Computer Science and Artificial Intelligence Laboratory
Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science
Terms of Use
Creative Commons Attribution-Noncommercial-Share Alike 3.0
Persistent DSpace Link
DOI of Published Version
http://portal.acm.org/citation.cfm?id=1870783
