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
- Venue:
- IWPT
- SIG:
- SIGPARSE
- Publisher:
- Note:
- Pages:
- 149–160
- Language:
- URL:
- https://aclanthology.org/W03-3017
- DOI:
- Cite (ACL):
- Joakim Nivre. 2003. An Efficient Algorithm for Projective Dependency Parsing. In Proceedings of the Eighth International Conference on Parsing Technologies, pages 149–160, Nancy, France.
- Cite (Informal):
- An Efficient Algorithm for Projective Dependency Parsing (Nivre, IWPT 2003)
- PDF:
- https://preview.aclanthology.org/nschneid-patch-4/W03-3017.pdf