Exploiting Structure in Parsing to 1-Endpoint-Crossing Graphs

Robin Kurtz, Marco Kuhlmann


Abstract
Deep dependency parsing can be cast as the search for maximum acyclic subgraphs in weighted digraphs. Because this search problem is intractable in the general case, we consider its restriction to the class of 1-endpoint-crossing (1ec) graphs, which has high coverage on standard data sets. Our main contribution is a characterization of 1ec graphs as a subclass of the graphs with pagenumber at most 3. Building on this we show how to extend an existing parsing algorithm for 1-endpoint-crossing trees to the full class. While the runtime complexity of the extended algorithm is polynomial in the length of the input sentence, it features a large constant, which poses a challenge for practical implementations.
Anthology ID:
W17-6312
Volume:
Proceedings of the 15th International Conference on Parsing Technologies
Month:
September
Year:
2017
Address:
Pisa, Italy
Venues:
IWPT | WS
SIG:
SIGPARSE
Publisher:
Association for Computational Linguistics
Note:
Pages:
78–87
Language:
URL:
https://www.aclweb.org/anthology/W17-6312
DOI:
Bib Export formats:
BibTeX MODS XML EndNote
PDF:
http://aclanthology.lst.uni-saarland.de/W17-6312.pdf