Non-Projective Dependency Parsing in Expected Linear Time

We present a novel transition system for dependency parsing, which constructs arcs only between adjacent words but can parse arbitrary non-projective trees by swapping the order of words in the input. Adding the swapping operation changes the time complexity for deterministic parsing from linear to quadratic in the worst case, but empirical estimates based on treebank data show that the expected running time is in fact linear for the range of data attested in the corpora. Evaluation on data from five languages shows state-of-the-art accuracy, with especially good results for the labeled exact match score.

[1]  Koby Crammer,et al.  Online Large-Margin Training of Dependency Parsers , 2005, ACL.

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

[3]  Joakim Nivre,et al.  Sorting Out Dependency Parsing , 2008, GoTAL.

[4]  Giorgio Satta,et al.  On the Complexity of Non-Projective Data-Driven Dependency Parsing , 2007, IWPT.

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

[6]  Joakim Nivre,et al.  Pseudo-Projective Dependency Parsing , 2005, ACL.

[7]  Ivan Titov,et al.  Online graph planarisation for synchronous parsing of semantic and syntactic dependencies , 2009, IJCAI 2009.

[8]  Jirí Havelka.  Beyond Projectivity: Multilingual Evaluation of Constraints and Measures on Non-Projective Structures , 2007, ACL.

[9]  Joakim Nivre,et al.  Labeled Pseudo-Projective Dependency Parsing with Support Vector Machines , 2006, CoNLL.

[10]  Giorgio Satta,et al.  Treebank Grammar Techniques for Non-Projective Dependency Parsing , 2009, EACL.

[11]  Keith Hall,et al.  Corrective Modeling for Non-Projective Dependency Parsing , 2005, IWPT.

[12]  Joakim Nivre,et al.  Algorithms for Deterministic Incremental Dependency Parsing , 2008, CL.

[13]  Yuji Matsumoto,et al.  Statistical Dependency Analysis with Support Vector Machines , 2003, IWPT.

[14]  Joakim Nivre.  Incremental Non-Projective Dependency Parsing , 2007, HLT-NAACL.

[15]  David J. Weir,et al.  Parsing Mildly Non-Projective Dependency Structures , 2009, EACL.

[16]  Michael A. Covington,et al.  A Fundamental Algorithm for Dependency Parsing , 2004 .

[17]  Sabine Buchholz,et al.  CoNLL-X Shared Task on Multilingual Dependency Parsing , 2006, CoNLL.

[18]  Giuseppe Attardi,et al.  Experiments with a Multilanguage Non-Projective Dependency Parser , 2006, CoNLL.

[19]  Joakim Nivre,et al.  Memory-Based Dependency Parsing , 2004, CoNLL.

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

[21]  Ivan Titov,et al.  A Latent Variable Model for Generative Dependency Parsing , 2007, Trends in Parsing Technology.

[22]  Joakim Nivre,et al.  Integrating Graph-Based and Transition-Based Dependency Parsers , 2008, ACL.

[23]  Richard Johansson,et al.  Incremental Dependency Parsing Using Online Learning , 2007, EMNLP-CoNLL.

[24]  Fernando Pereira,et al.  Multilingual Dependency Analysis with a Two-Stage Discriminative Parser , 2006, CoNLL.

[25]  Joakim Nivre,et al.  Incrementality in Deterministic Dependency Parsing , 2004 .

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

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