Skip to main content
SpringerLink
Log in
Book cover

Language Processing with Perl and Prolog pp 403–437Cite as

Dependency Parsing

  • Chapter
  • First Online:

Part of the book series: Cognitive Technologies ((COGTECH))

Abstract

Parsing dependencies consists of finding links between heads (also called governors) and modifiers (or dependents) – one word being the root of the sentence (Fig. 13.1). In addition, each link can be annotated with a grammatical function.

This is a preview of subscription content, log in via an institution.

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   69.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Hardcover Book
USD   99.99
Price excludes VAT (USA)
  • Durable hardcover edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

References

  • Alshawi, H. (1996). Head automata and bilingual tiling: Translation with minimal representations. In Proceedings of the 34th annual meeting on association for computational linguistics, Santa Cruz (pp. 167–176).

    Google Scholar 

  • Buchholz, S., & Marsi, E. (2006). CoNLL-X shared task on multilingual dependency parsing. In Proceedings of the tenth conference on computational natural language learning (CoNLL-X), New York City (pp. 149–164). Association for Computational Linguistics.

    Google Scholar 

  • Carreras, X. (2007). Experiments with a higher-order projective dependency parser. In Proceedings of the CoNLL shared task session of EMNLP-CoNLL, Prague (pp. 957–961).

    Google Scholar 

  • Constant, P. (1991). Analyse syntaxique par couches. Thèse de doctorat, École Nationale Supérieure des Télécommunications, Paris.

    Google Scholar 

  • Covington, M. A. (1989). GULP 2.0, an extension of Prolog for unification-based grammar. Research report AI-1989-01, Artificial Intelligence Programs, University of Georgia.

    Google Scholar 

  • Covington, M. A. (1990). Parsing discontinuous constituents in dependency grammar. Computational Linguistics, 16(4), 234–236.

    MathSciNet  Google Scholar 

  • Covington, M. A. (1994a). Discontinuous dependency parsing of free and fixed word order: Work in progress. Research report AI-1994-02, Artificial Intelligence Programs, The University of Georgia.

    Google Scholar 

  • Covington, M. A. (2001). A fundamental algorithm for dependency parsing. In Proceedings of the 39th annual ACM Southeast conference, Athens (pp. 95–102). Version with corrections: Retrieved October 25, 2013, from http://www.ai.uga.edu/mc/dgpacmcorr.pdf

  • Einarsson, J. (1976). Talbankens skriftspråkskonkordans. Technical report, Lund University, Institutionen för nordiska språk, Lund.

    Google Scholar 

  • Eisner, J. (1996). Three new probabilistic models for dependency parsing: An exploration. In Proceedings of the 16th international conference on computational linguistics (COLING-96), Copenhagen (pp. 340–345).

    Google Scholar 

  • Eisner, J. (2000). Bilexical grammars and their cubic-time parsing algorithms. In H. C. Bunt & A. Nijholt (Eds.), Advances in probabilistic and other parsing technologies (pp. 29–62). Kluwer Academic Publishers.

    Google Scholar 

  • El Guedj, P.-O. (1996). Analyse syntaxique par charts combinant règles de dépendance et règles syntagmatiques. PhD thesis, Université de Caen.

    Google Scholar 

  • Frühwirth, T. (1998). Theory and practice of constraint handling rules. Journal of Logic Programming, 37(1–3), 95–138.

    Article  MATH  MathSciNet  Google Scholar 

  • Harper, M. H., Hockema, S. A., & White, C. M. (1999). Enhanced constraint dependency grammar parsers. In Proceedings of the IASTED international conference on artificial intelligence and soft computing, Honolulu.

    Google Scholar 

  • Hellwig, P. (1980). PLAIN – a program system for dependency analysis and for simulating natural language inference. In L. Bolc (Ed.), Representation and processing of natural language (pp. 271–376). München: Hanser.

    Google Scholar 

  • Hellwig, P. (1986). Dependency unification grammar (DUG). In Proceedings of the 11th international conference on computational linguistics (COLING 86), Bonn (pp. 195–198).

    Google Scholar 

  • Järvinen, T., & Tapanainen, P. (1997). A dependency parser for English. Technical report TR-1, Department of General Linguistics, University of Helsinki.

    Google Scholar 

  • Johansson, R., & Nugues, P. (2007b). Incremental dependency parsing using online learning. In Proceedings of the CoNLL shared task session of EMNLP-CoNLL, Prague (pp. 1134–1138).

    Google Scholar 

  • Koch, U. (1993). The enhancement of a dependency parser for Latin. Technical report AI-1993-03, Artificial Intelligence Programs, University of Georgia.

    Google Scholar 

  • Kübler, S., McDonald, R., & Nivre, J. (2009). Dependency parsing. San Rafael: Morgan and Claypool Publishers.

    Google Scholar 

  • Kunze, J. (1967). Die Behandlung nicht-projektiver Strukturen bei der syntaktischen Analyse und Synthese des englischen und des deutschen. In MASPEREVOD-67: Internationales Symposium der Mitgliedsländer des RGW, Budapest (pp. 2–15).

    Google Scholar 

  • Lin, D. (1995). A dependency-based method for evaluating broad-coverage parsers. In Proceedings of IJCAI-95, Montreal (pp. 1420–1427).

    Google Scholar 

  • Maruyama, H. (1990). Constraint dependency grammar and its weak generative capacity. Computer Software, 7(3), 50–59. (In Japanese).

    Google Scholar 

  • McDonald, R. (2006). Discriminative training and spanning tree algorithms for dependency parsing. PhD thesis, University of Pennsylvania.

    Google Scholar 

  • Nilsson, J., Hall, J., & Nivre, J. (2005). MAMBA meets TIGER: Reconstructing a Swedish treebank from antiquity. In Proceedings of the NODALIDA special session on treebanks, Joensuu.

    Google Scholar 

  • Nilsson, P., & Nugues, P. (2010). Automatic discovery of feature sets for dependency parsing. In Proceedings of the 23rd international conference on computational linguistics (COLING 2010), Beijing (pp. 824–832). Coling 2010 Organizing Committee.

    Google Scholar 

  • Nivre, J. (2003). An efficient algorithm for projective dependency parsing. In Proceedings of the 8th international workshop on parsing technologies (IWPT 03), Nancy (pp. 149–160).

    Google Scholar 

  • Nivre, J. (2006). Inductive dependency parsing. Dordrecht: Springer.

    Book  MATH  Google Scholar 

  • Nivre, J., Hall, J., Kübler, S., McDonald, R., Nilsson, J., Riedel, S., & Yuret, D. (2007). The CoNLL 2007 shared task on dependency parsing. In Proceedings of the CoNLL shared task session of EMNLP-CoNLL 2007, Prague (pp. 915–932).

    Google Scholar 

  • Nivre, J., Hall, J., Nilsson, J., Eryigit, G., & Marinov, S. (2006). Labeled pseudo-projective dependency parsing with support vector machines. In Proceedings of the tenth conference on computational natural language learning (CoNLL), New York (pp. 221–225).

    Google Scholar 

  • Nivre, J., & Nilsson, J. (2005). Pseudo-projective dependency parsing. In Proceedings of the 43rd annual meeting of the association for computational linguistics (ACL’05), Ann Arbor (pp. 99–106).

    Google Scholar 

  • Sleator, D., & Temperley, D. (1993). Parsing English with a link grammar. In Proceedings of the third international workshop on parsing technologies, Tilburg (pp. 277–291).

    Google Scholar 

  • Tapanainen, P., & Järvinen, T. (1997). A non-projective dependency parser. In Proceedings of the fifth conference on applied natural language processing (ANLP’97), Washington, DC (pp. 64–71).

    Google Scholar 

  • Vergne, J. (1998). Entre arbre de dépendance et ordre linéaire, les deux processus de transformation: Linéarisation, puis reconstruction de l’arbre. Cahiers de grammaire, 23.

    Google Scholar 

  • Zhang, Y., & Nivre, J. (2011). Transition-based dependency parsing with rich non-local features. In Proceedings of the 49th annual meeting of the association for computational linguistics: Human language technologies, Portland (pp. 188–193).

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science, Lund University, Lund, Sweden

    Pierre M. Nugues

Authors
  1. Pierre M. Nugues
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

Copyright information

© 2014 Springer-Verlag Berlin Heidelberg

About this chapter

Cite this chapter

Nugues, P.M. (2014). Dependency Parsing. In: Language Processing with Perl and Prolog. Cognitive Technologies. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-41464-0_13

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-41464-0_13

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-41463-3

  • Online ISBN: 978-3-642-41464-0

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation