Restricted Non-Projectivity
Coverage vs. Efficiency
Bibliographic Data
| ID | 12156232 |
|---|---|
| Authors | Carlos Gómez‐Rodríguez (0000-0003-0752-8812, Universidade da Coruña, corresponding author), Carlos Gómez-Rodríguez (Universidade da Coruña) |
| Year | 2016 |
| Volume | 42 |
| Issue | 4 |
| Pages | 809-817 |
| Publication date | 2016-09-28 |
| Open Access | Yes |
| Type | ARTICLE |
| Venue | Computational Linguistics (JOURNAL) |
| Journal identifiers | ISSN: 0891-2017 • E-ISSN: 1530-9312 |
| Publisher | Association for Computational Linguistics (PUBLISHER • US) |
| DOI | 10.1162/coli_a_00267 |
| OpenAlex | W2525977272 |
| Language | EN |
| Citations received | 1 |
| References cited | 13 |
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 MH k trees, depending on the level of coverage desired. We also present some properties of the relation of MH k trees to other relevant classes of trees
Data mining · Dependency (UML · Dependency grammar · Information retrieval · Natural language processing · Parsing · Range (aeronautics · Relation (database · Syntactic structure · Syntax · Computer Science · Machine Learning and Algorithms · Natural Language Processing Techniques · semigroups and automata theory · Software Engineering Research · Topic Modeling · Artificial Intelligence
| Citations per year | 0.5 |
|---|---|
| Citation span | 2024 - 2024 (1) |
| Highly cited | No |