Parsing to Noncrossing Dependency Graphs
2015 (English)In: Transactions of the Association for Computational Linguistics, ISSN 2307-387X, Vol. 3, 559-570 p.Article in journal (Refereed) Published
We study the generalization of maximum spanning tree dependency parsing to maximum acyclic subgraphs. Because the underlying optimization problem is intractable even under an arc-factored model, we consider the restriction to noncrossing dependency graphs. Our main contribution is a cubic-time exact inference algorithm for this class. We extend this algorithm into a practical parser and evaluate its performance on four linguistic data sets used in semantic dependency parsing. We also explore a generalization of our parsing framework to dependency graphs with pagenumber at most $k$ and show that the resulting optimization problem is NP-hard for k ≥ 2.
Place, publisher, year, edition, pages
Association for Computational Linguistics, 2015. Vol. 3, 559-570 p.
natural language processing, algorithms, complexity theory
Language Technology (Computational Linguistics)
IdentifiersURN: urn:nbn:se:liu:diva-124718OAI: oai:DiVA.org:liu-124718DiVA: diva2:902487