We found a match
Your institution may have access to this item. Find your institution then sign in to continue.
- Title
Restricted Non-Projectivity: Coverage vs. Efficiency.
- Authors
Gómez-Rodríguez, Carlos
- Abstract
In the last decade, various restricted classes of non-projective dependency trees have been proposed with the goal of achieving a good tradeoff between parsing efficiency and coverage of the syntactic structures found in natural languages. We perform an extensive study measuring the coverage of a wide range of such classes on corpora of 30 languages under two different syntactic annotation criteria. The results show that, among the currently known relaxations of projectivity, the best tradeoff between coverage and computational complexity of exact parsing is achieved by either 1-endpoint-crossing trees or MHk trees, depending on the level of coverage desired. We also present some properties of the relation of MHk trees to other relevant classes of trees.
- Subjects
DEPENDENCY grammar; SYNTAX (Grammar); COMPUTATIONAL linguistics; PARSING (Grammar); COMPUTATIONAL complexity
- Publication
Computational Linguistics, 2016, Vol 42, Issue 4, p810
- ISSN
0891-2017
- Publication type
Article
- DOI
10.1162/COLIa00267