A linear-time transition system for crossing interval trees

15Citations
Citations of this article
82Readers
Mendeley users who have this article in their library.

Abstract

We define a restricted class of non-projective trees that 1) covers many natural language sentences; and 2) can be parsed exactly with a generalization of the popular arc-eager system for projective trees (Nivre, 2003). Crucially, this generalization only adds constant overhead in run-time and space keeping the parser's total run-time linear in the worst case. In empirical experiments, our proposed transition-based parser is more accurate on average than both the arc-eager system or the swap-based system, an unconstrained nonprojective transition system with a worst-case quadratic runtime (Nivre, 2009).

Cite

CITATION STYLE

APA

Pitler, E., & McDonald, R. (2015). A linear-time transition system for crossing interval trees. In NAACL HLT 2015 - 2015 Conference of the North American Chapter of the Association for Computational Linguistics: Human Language Technologies, Proceedings of the Conference (pp. 662–671). Association for Computational Linguistics (ACL). https://doi.org/10.3115/v1/n15-1068

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free