liu.seSearch for publications in DiVA
Change search
ReferencesLink to record
Permanent link

Direct link
Efficient Parsing for Head-Split Dependency Trees
Dept. of Information Engineering, University of Padua, Padua, Italy.
Uppsala universitet, Institutionen för lingvistik och filologi. (Datorlingvistik)ORCID iD: 0000-0002-2492-9872
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
Abstract [en]

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.
National Category
Language Technology (Computational Linguistics)
Research subject
Computational Linguistics
URN: urn:nbn:se:liu:diva-100278OAI: diva2:661567
Available from: 2013-07-17 Created: 2013-11-04 Last updated: 2014-10-08Bibliographically approved

Open Access in DiVA

No full text

Other links

Link to publication

Search in DiVA

By author/editor
Kuhlmann, Marco
Language Technology (Computational Linguistics)

Search outside of DiVA

GoogleGoogle Scholar
The number of downloads is the sum of all downloads of full texts. It may include eg previous versions that are now no longer available

Total: 22 hits
ReferencesLink to record
Permanent link

Direct link