Restricted Non-Projectivity: Coverage vs. Efficiency
Ver/ abrir
Use este enlace para citar
http://hdl.handle.net/2183/19288Coleccións
- GI-LYS - Artigos [41]
Metadatos
Mostrar o rexistro completo do ítemTítulo
Restricted Non-Projectivity: Coverage vs. EfficiencyAutor(es)
Data
2016-12Cita bibliográfica
Carlos Gómez-Rodríguez, Restricted Non-Projectivity: Coverage vs. Efficiency, Computational Linguistics, 42(4):809-817, 2016
Resumo
[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 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.
Versión do editor
Dereitos
Atribución 3.0 España Computational Linguistics is Open Access. All content is freely available in electronic format (Full text HTML, PDF, and PDF Plus) to readers across the globe. All articles are published under a CC BY 4.0 license. For more information on allowed uses, please view the CC license.
ISSN
0891-2017