Dependency parsing using dependency graph for storing alternative structures

Tomasz Obrebski


Abstract
In this paper an efficient algorithm for dependency parsing is described in which ambiguous dependency structure of a sentence is represented in the form of a graph. The idea of the algorithm is shortly outlined and some issues as to its time complexity are discussed.
Anthology ID:
W03-3018
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:
Language:
URL:
https://www.aclweb.org/anthology/W03-3018
DOI:
Bib Export formats:
BibTeX MODS XML EndNote
PDF:
http://aclanthology.lst.uni-saarland.de/W03-3018.pdf