Efficient Parsing for Head-Split Dependency Trees
2013 (English)In: Transactions of the Association for Computational Linguistics, ISSN 2307-387X, Vol. 1, no July, 267-278 p.Article in journal (Other academic) Published
Head splitting techniques have been successfully exploited to improve the asymptotic runtime of parsing algorithms for projective dependency trees, under the arc-factored model. In this article we extend these techniques to a class of non-projective dependency trees, called well-nested dependency trees with block-degree at most 2, which has been previously investigated in the literature. We define a structural property that allows head splitting for these trees, and present two algorithms that improve over the runtime of existing algorithms at no significant loss in coverage.
Place, publisher, year, edition, pages
Stroudsburg, PA, USA: Association for Computational Linguistics, 2013. Vol. 1, no July, 267-278 p.
Language Technology (Computational Linguistics)
Research subject Computational Linguistics
IdentifiersURN: urn:nbn:se:liu:diva-100278OAI: oai:DiVA.org:liu-100278DiVA: diva2:661567