Exploiting Structure in Parsing to 1-Endpoint-Crossing Graphs
Robin
Kurtz
author
Marco
Kuhlmann
author
2017-sep
text
Proceedings of the 15th International Conference on Parsing Technologies
Association for Computational Linguistics
Pisa, Italy
conference publication
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.
kurtz-kuhlmann-2017-exploiting
https://www.aclweb.org/anthology/W17-6312
2017-sep
78
87