Mildly Context-Sensitive Dependency Languages

Dependency-based representations of natural language syntax require a fine balance between structural flexibility and computational complexity. In previous work, several constraints have been proposed to identify classes of dependency structures that are wellbalanced in this sense; the best-known but also most restrictive of these is projectivity. Most constraints are formulated on fully specified structures, which makes them hard to integrate into models where structures are composed from lexical information. In this paper, we show how two empirically relevant relaxations of projectivity can be lexicalized, and how combining the resulting lexicons with a regular means of syntactic composition gives rise to a hierarchy of mildly context-sensitive dependency languages.

[1]  Giorgio Satta,et al.  Efficient Parsing for Bilexical Context-Free Grammars and Head Automaton Grammars , 1999, ACL.

[2]  Peter Neuhaus,et al.  The Complexity of Recognition of Linguistically Adequate Dependency Grammars , 1997, ACL.

[3]  Hiroshi Maruyama,et al.  Structural Disambiguation with Constraint Propagation , 1990, ACL.

[4]  Günter Hotz,et al.  On Parsing Coupled-Context-Free Languages , 1996, Theor. Comput. Sci..

[5]  Chris Quirk,et al.  Dependency Treelet Translation: Syntactically Informed Phrasal SMT , 2005, ACL.

[6]  Aravind K. Joshi,et al.  A Formal Look at Dependency Grammars and Phrase-Structure Grammars, with Special Consideration of Word-Order Phenomena , 1994, ArXiv.

[7]  Fernando Pereira,et al.  Non-Projective Dependency Parsing using Spanning Tree Algorithms , 2005, HLT.

[8]  Ferenc Gécseg,et al.  Tree Languages , 1997, Handbook of Formal Languages.

[9]  G. E. Barton Jr..  On the Complexity of ID/LP Parsing , 1985, CL.

[10]  Aron Culotta,et al.  Dependency Tree Kernels for Relation Extraction , 2004, ACL.

[11]  Joakim Nivre.  Constraints on Non-Projective Dependency Parsing , 2006, EACL.

[12]  Fernando Pereira,et al.  Online Learning of Approximate Dependency Parsing Algorithms , 2006, EACL.

[13]  Aravind K. Joshi,et al.  Natural language parsing: Tree adjoining grammars: How much context-sensitivity is required to provide reasonable structural descriptions? , 1985 .

[14]  Joakim Nivre,et al.  Mildly Non-Projective Dependency Structures , 2006, ACL.

[15]  David J. Weir,et al.  Characterizing Structural Descriptions Produced by Various Grammatical Formalisms , 1987, ACL.

[16]  Manuel Bodirsky,et al.  Well-Nested Drawings as Models of Syntactic Structure ? , 2005 .

[17]  Giorgio Satta,et al.  Recognition of Linear Context-Free Rewriting Systems , 1992, ACL.

[18]  Eva Hajicová,et al.  Condition of Projectivity in the Underlying Dependency Structures , 2004, COLING.