This article describes the Constraint-based Dependency Parser architecture used at Evalita 2011 Dependency Parsing Task, giving a detailed analysis of the results obtained at the official evaluation. The Italian grammar has been expressed for the first time as a set of constraints and an ad-hoc constraints solver has been then applied to restrict possible analysis. Multiple solutions of a given sentence have been reduced to one by means of an evidence scoring system that makes use of an indexed version of Italian Wikipedia created for the purpose. The attachment score obtained is 96.16%, giving the best result so far for a dependency parser for the Italian language. © Springer-Verlag Berlin Heidelberg 2013.
CITATION STYLE
Grella, M., & Nicola, M. (2013). Parsit at Evalita 2011 dependency parsing task. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 7689 LNAI, pp. 21–29). https://doi.org/10.1007/978-3-642-35828-9_3
Mendeley helps you to discover research relevant for your work.