Non-Projective Dependency Parsing

We investigate a series of graph-theoretic constraints on non-projective dependency parsing and their effect on expressivity, i.e. whether they allow naturally occurring syntactic constructions to be adequately represented, and efficiency, …...

Following (McDonald et al., 2005), we present an application of a maximum spanning tree algorithm for a directed graph to non-projective labeled depen- dency parsing. Using a variant of the …...

Following (Blitzer et al., 2006), we present an application of structural correspondence learning to non-projective dependency pars- ing (McDonald et al., 2005). To induce the correspondences among dependency edges from …...

This paper presents a non-projective dependency parsing system that is transition-based and op- erates in three steps. The three steps include one classical method for projective dependency parsing and two …...

AbstractWe present a new method for the joint task of tagging and non-projective dependency parsing. We demonstrate its usefulness with an application to discontinuous phrase-structure parsing where decoding lexicalized spines …...

AbstractWe propose a method for non-projective dependency parsing by incrementally predicting a set of edges. Since the edges do not have a pre-specified order, we propose a set-based learning method. …...