Parsing mildly non-projective dependency structures

Gómez-Rodríguez, Carlos, Weir, David and Carroll, John (2009) Parsing mildly non-projective dependency structures. In: EACL '09 Proceedings of the 12th Conference of the European Chapter of the Association for Computational Linguistics, Athens, Greece.

Full text not available from this repository.

Abstract

We present parsing algorithms for various mildly non-projective dependency formalisms. In particular, algorithms are presented for: all well-nested structures of gap degree at most 1, with the same complexity as the best existing parsers for constituency formalisms of equivalent generative power; all well-nested structures with gap degree bounded by any constant k; and a new class of structures with gap degree up to k that includes some ill-nested structures. The third case includes all the gap degree k structures in a number of dependency treebanks.

Item Type: Conference or Workshop Item (Paper)
Schools and Departments: School of Engineering and Informatics > Informatics
Depositing User: David Weir
Date Deposited: 06 Feb 2012 18:55
Last Modified: 24 Apr 2012 09:18
URI: http://sro.sussex.ac.uk/id/eprint/18946
📧 Request an update