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...
| Main Authors: | , , , , |
|---|---|
| Other Authors: | |
| 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 |