文章基本信息

标题：Restricted Non-Projectivity: Coverage vs. Efficiency
本地全文：下载
作者：Carlos Gómez-Rodríguez
期刊名称：Computational Linguistics
印刷版ISSN：0891-2017
电子版ISSN：1530-9312
出版年度：2016
卷号：42
期号：4
页码：809-817
DOI：10.1162/COLI_a_00267
语种：English
出版社：MIT Press
摘要：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.