Abstract
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.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Attardi, G.: Experiments with a multilanguage non-projective dependency parser. In: Proceedings of the Tenth Conference on Computational Natural Language Learning. CoNLL-X 2006, pp. 166–170. Association for Computational Linguistics, Stroudsburg (2006)
Barbosa, P., Fox, D., Hagstrom, P., McGinnis, M., Pesetsky, D. (eds.): Is the Best Good Enough? Optimality and Competition in Syntax. MIT Press, Cambridge (1998)
Bosco, C., Lavelli, A.: Annotation schema oriented evaluation for dependency parsing validation. In: Proceedings of the Ninth International Workshop on Treebanks and Linguistic Theories (TLT 2009), Tartu (2010)
Bosco, C., Mazzei, A.: The Evalita 2011 Parsing Task: the Dependency Track. In: Working Notes of EVALITA 2011, Rome, Italy, January 24-25 (2012) ISSN 2240-5186
Bosco, C., Montemagni, S., Mazzei, A., Lombardo, V., Dell’Orletta, F., Lenci, A.: Evalita 2009 parsing task: comparing dependency parsers and treebanks. In: Proceedings of Evalita 2009, Reggio Emilia (2009), http://www.evalita.it
Ciaramita, M., Johnson, M.: Supersense Tagging of Unknown Nouns in WordNet. In: Procedings of EMNLP 2003 (2003)
Debusmann, R., Duchier, D., Kruijff, G.J.M.: Extensible dependency grammar: A new methodology. In: Proceedings of the COLING 2004 Workshop on Recent Advances in Dependency Grammar, Geneva/SUI (2004)
Duchier, D.: Axiomatizing dependency parsing using set constraints. In: 6th Meeting on Mathematics of Language, Orlando/FL (1999)
Eisner, J.M.: Three new probabilistic models for dependency parsing: An exploration. In: Proceedings of the 16th International Conference on Computational Linguistics COLING 1996, pp. 340–345 (1997)
Grella, M., Nicola, M., Christen, D.: Experiments with a Constraint-based Dependency Parser. In: Working Notes of EVALITA 2011, Rome, Italy, January 24-25 (2012) ISSN 2240-5186
Harper, M.P., Helzerman, R.A., Helzerman, A.A.: Extensions to constraint dependency parsing for spoken language processing. Computer Speech and Language 9, 187–234 (1995)
Lesmo, L.: The Turin University parser at Evalita 2009. In: Proceedings of Evalita 2009, Reggio Emilia (2009)
Lesmo, L., Lombardo, V., Bosco, C.: Treebank development: the TUT approach. In: Proceedings of the International Conference on Natural Language Processing, pp. 61–70. Vikas Publishing House (2002), http://www.di.unito.it/~tutreeb
Maruyama, H.: Structural disambiguation with constraint propagation. In: Proceedings of the 28th Conference on Association for Computational Linguistics, pp. 31–38. Association for Computational Linguistics (1990)
McCord, M.C.: Slot grammars. Computational Linguistics 6, 31–43 (1980)
Mcdonald, R., Pereira, F.: Online Learning of Approximate Dependency Parsing Algorithms
Menzel, W., Schrder, I.: Decision procedures for dependency parsing using graded constraints. In: Proceedings of ACL 1990, pp. 78–87 (1998)
Nivre, J.: An efficient algorithm for projective dependency parsing. In: Proceedings of the 8th International Workshop on Parsing Technologies (IWPT), pp. 149–160 (2003)
Robaldo, L., Caselli, T., Grella, M.: Rule-based creation of TimeML documents from Dependency Trees. In: AI*IA 2011, pp. 389–394 (2011)
Rossi, F., Van Beek, P., Walsh, T.: Handbook of Constraint Programming (Foundations of Artificial Intelligence). Elsevier Science Inc., New York (2006)
Schulte, C., Tack, G., Lagerkvist, M.Z.: Gecode: A generic constraint development environment (November 2006), http://www.gecode.org/
Taft, S.T., Duff, R.A., Brukardt, R.L., Ploedereder, E., Leroy, P.: Ada 2005 Reference Manual. In: Language and Standard Libraries: International Standard ISO/IEC 8652/1995(E) with Technical Corrigendum 1 and Amendment 1. LNCS. Springer-Verlag New York, Inc, Secaucus (2007)
Tsang, E.P.K.: Foundations of constraint satisfaction. Computation in Cognitive Science. Academic Press (1993)
Wikipedia: Wikipedia, l’enciclopedia libera (2011), http://it.wikipedia.org
Yamada, H., Matsumoto, Y.: Statistical Dependency Analysis with Support Vector Machines. In: Proceedings of IWPT, pp. 195–206 (2003)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2013 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Grella, M., Nicola, M. (2013). Parsit at Evalita 2011 Dependency Parsing Task. In: Magnini, B., Cutugno, F., Falcone, M., Pianta, E. (eds) Evaluation of Natural Language and Speech Tools for Italian. EVALITA 2012. Lecture Notes in Computer Science(), vol 7689. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-35828-9_3
Download citation
DOI: https://doi.org/10.1007/978-3-642-35828-9_3
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-35827-2
Online ISBN: 978-3-642-35828-9
eBook Packages: Computer ScienceComputer Science (R0)