Abstract
This study presents new language and treebank independent graph transformations that improve accuracy in data-driven dependency parsing. We show that individual generic graph transformations can increase accuracy across treebanks, but especially when they are combined using established parser combination techniques. The combination experiments also indicate that the presumed best way to combine parsers, using the highest scoring parsers, is not necessarily the best approach.
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
Johnson, M.: PCFG Models of Linguistic Tree Representations. Computational Linguistics 24, 613–632 (1998)
Klein, D., Manning, C.: Accurate unlexicalized parsing. In: Proceedings of ACL, pp. 423–430 (2003)
McDonald, R., Pereira, F.: Online Learning of Approximate Dependency Parsing Algorithms. In: Proceedings of EACL, pp. 81–88 (2006)
Nilsson, J., Nivre, J., Hall, J.: Generalizing Tree Transformations for Inductive Dependency Parsing. In: Proceedings of ACL, pp. 968–975 (2007)
Henderson, J., Brill, E.: Exploiting diversity in natural language processing: combining parsers. In: Proceedings of EMNLP, pp. 187–194 (1999)
Sagae, K., Lavie, A.: Parser Combination by Reparsing. In: Proceedings of HLT-NAACL, Companion Volume: Short Papers, pp. 129–132 (2006)
Bikel, D.: Intricacies of Collins’ parsing model. Computational Linguistics 30, 479–511 (2004)
Hall, K., Novák, V.: Corrective modeling for non-projective dependency parsing. In: Proceedings of IWPT, pp. 42–52 (2005)
Nivre, J., Nilsson, J.: Pseudo-Projective Dependency Parsing. In: Proceedings of ACL, pp. 99–106 (2005)
Mel’čuk, I.: Dependency Syntax: Theory and Practice. State University of New York Press (1988)
Zeman, D., Žabokrtský, Z.: Improving Parsing Accuracy by Combining Diverse Dependency Parsers. In: Proceedings of IWPT-2005, pp. 171–178 (2005)
Georgiadis, L.: Arborescence optimization problems solvable by Edmonds’ algorithm. Theoretical Computer Science 301, 427–437 (2003)
McDonald, R., Pereira, F., Ribarov, K., Hajič, J.: Non-projective dependency parsing using spanning tree algorithms. In: Proceedings of HLT/EMNLP, pp. 523–530 (2005)
Hall, J., Nilsson, J., Nivre, J., Eryigit, G., Megyesi, B., Nilsson, M., Saers, M.: Single Malt or Blended? A Study in Multilingual Parser Optimization. In: Proceedings of EMNLP-CoNLL, pp. 933–939 (2007)
Nivre, J., Hall, J., Kübler, S., McDonald, R., Nilsson, J., Riedel, S., Yuret, D.: The CoNLL 2007 Shared Task on Dependency Parsing. In: Proceedings of EMNLP-CoNLL, pp. 915–932 (2007)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2008 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Nilsson, J., Nivre, J. (2008). Dependency Parsing by Transformation and Combination. In: Nordström, B., Ranta, A. (eds) Advances in Natural Language Processing. GoTAL 2008. Lecture Notes in Computer Science(), vol 5221. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-85287-2_33
Download citation
DOI: https://doi.org/10.1007/978-3-540-85287-2_33
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-85286-5
Online ISBN: 978-3-540-85287-2
eBook Packages: Computer ScienceComputer Science (R0)