@InProceedings{kurtz-kuhlmann:2017:IWPT,
author = {Kurtz, Robin and Kuhlmann, Marco},
title = {Exploiting Structure in Parsing to 1-Endpoint-Crossing Graphs},
booktitle = {Proceedings of the 15th International Conference on Parsing Technologies},
month = {September},
year = {2017},
address = {Pisa, Italy},
publisher = {Association for Computational Linguistics},
pages = {78--87},
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.},
url = {http://www.aclweb.org/anthology/W17-6312}
}