Year: 2016
Type: article
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 MHktrees, depending on the level of coverage desired. We also present some properties of the relation of MHktrees to other relevant classes of trees.
Source: Computational Linguistics
DOI: 10.1162/coli_a_00267
Author: Carlos Gómez-Rodríguez
Institution: Universidade da Coruña
Language: English
Subfield: Artificial Intelligence
Field: Computer Science
Domain: Physical Sciences
Open Access status: bronze
Funder: Xunta de Galicia
OpenAlex ID: W2525977272