An Efficient Algorithm for Projective Dependency Parsing

Joakim Nivre


Abstract
This paper presents a deterministic parsing algorithm for projective dependency grammar. The running time of the algorithm is linear in the length of the input string, and the dependency graph produced is guaranteed to be projective and acyclic. The algorithm has been experimentally evaluated in parsing unrestricted Swedish text, achieving an accuracy above 85% with a very simple grammar.
Anthology ID:
W03-3017
Volume:
Proceedings of the Eighth International Conference on Parsing Technologies
Month:
April
Year:
2003
Address:
Nancy, France
Venues:
IWPT | WS
SIG:
SIGPARSE
Publisher:
Note:
Pages:
149–160
Language:
URL:
https://www.aclweb.org/anthology/W03-3017
DOI:
Bib Export formats:
BibTeX MODS XML EndNote
PDF:
http://aclanthology.lst.uni-saarland.de/W03-3017.pdf