Dependency Parsing

Bibliographic Data

ID16843101
AuthorsJoakim Nivre (0000-0002-7873-3971, Uppsala University, corresponding author)
Year2010
Volume4
Issue3
Pages138-152
Publication date2010-03-01
Open AccessYes
TypeARTICLE
VenueLanguage and Linguistics Compass (JOURNAL)
Journal identifiersISSN: 1749-818X • E-ISSN: 1749-818X
PublisherWiley (PUBLISHER • GB)
DOI10.1111/j.1749-818x.2010.00187.x
OpenAlexW3096367574
LanguageEN
Citations received2
References cited36

Dependency parsing is a form of syntactic parsing of natural language based on the theoretical tradition of dependency grammar. It has recently gained widespread interest in the computational linguistics community and has been used for applications such as information extraction, machine translation and question answering. In this article, we review the current state of the art in dependency parsing, starting with a characterization of the basic problem and some motivation for why dependency parsing may be a useful alternative to other forms of syntactic parsing. The major part of the article is devoted to an examination of the four main approaches that exist in the field today: context‐free dependency parsing, constraint dependency parsing, graph‐based dependency parsing, and transition‐based dependency parsing. Each approach is described in detail and its strengths and weaknesses are highlighted

Bottom-up parsing · Computational linguistics · Context-free grammar · Dependency grammar · Dependency graph · Graph · L-attributed grammar · Natural language processing · Parser combinator · Parsing · Parsing expression grammar · S-attributed grammar · Top-down parsing · Top-down parsing language · Computer Science · Natural Language Processing Techniques · Semantic Web and Ontologies · Topic Modeling · Artificial Intelligence · Theoretical Computer Science