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
Venue:
IWPT
SIG:
SIGPARSE
Publisher:
Note:
Pages:
Language:
URL:
https://aclanthology.org/W03-3018
DOI:
Bibkey:
Cite (ACL):
Tomasz Obrebski. 2003. Dependency parsing using dependency graph for storing alternative structures. In Proceedings of the Eighth International Conference on Parsing Technologies, Nancy, France.
Cite (Informal):
Dependency parsing using dependency graph for storing alternative structures (Obrebski, IWPT 2003)
Copy Citation:
PDF:
https://aclanthology.org/W03-3018.pdf