A Reranking Approach for Dependency Parsing with Variable-sized Subtree Features

Employing higher-order subtree structures in graph-based dependency parsing has shown substantial improvement over the accuracy, however suffers from the inefficiency increasing with the order of subtrees. We present a new reranking approach for dependency parsing that can utilize complex subtree representation by applying efficient subtree selection heuristics. We demonstrate the effectiveness of the approach in experiments conducted on the Penn Treebank and the Chinese Treebank. Our system improves the baseline accuracy from 91.88% to 93.37% for English, and in the case of Chinese from 87.39% to 89.16%.

[1]  Rens Bod,et al.  A generative re-ranking model for dependency parsing , 2009, IWPT.

[2]  Daisuke Kawahara,et al.  Case Frame Compilation from the Web using High-Performance Computing , 2006, LREC.

[3]  Yuji Matsumoto,et al.  Third-order Variational Reranking on Packed-Shared Dependency Forests , 2011, EMNLP.

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

[5]  Michael Collins,et al.  Efficient Third-Order Dependency Parsers , 2010, ACL.

[6]  Joakim Nivre,et al.  Transition-based Dependency Parsing with Rich Non-local Features , 2011, ACL.

[7]  Liang Huang,et al.  Forest Reranking: Discriminative Parsing with Non-Local Features , 2008, ACL.

[8]  Xavier Carreras,et al.  Simple Semi-supervised Dependency Parsing , 2008, ACL.

[9]  Jason Eisner,et al.  Three New Probabilistic Models for Dependency Parsing: An Exploration , 1996, COLING.

[10]  Adwait Ratnaparkhi,et al.  A Maximum Entropy Model for Part-Of-Speech Tagging , 1996, EMNLP.

[11]  Eric P. Xing,et al.  Turbo Parsers: Dependency Parsing by Approximate Variational Inference , 2010, EMNLP.

[12]  Xavier Carreras,et al.  An Empirical Study of Semi-supervised Structured Conditional Models for Dependency Parsing , 2009, EMNLP.

[13]  David Chiang,et al.  Better k-best Parsing , 2005, IWPT.

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

[15]  Bo Xu,et al.  Probabilistic Models for Action-Based Chinese Dependency Parsing , 2007, ECML.

[16]  Eugene Charniak,et al.  Coarse-to-Fine n-Best Parsing and MaxEnt Discriminative Reranking , 2005, ACL.

[17]  Stephen Clark,et al.  A Tale of Two Parsers: Investigating and Combining Graph-based and Transition-based Dependency Parsing , 2008, EMNLP.

[18]  Michael Collins,et al.  Discriminative Reranking for Natural Language Parsing , 2000, CL.

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

[20]  Keith Hall,et al.  K-best Spanning Tree Parsing , 2007, ACL.

[21]  Kun Yu,et al.  Chinese Dependency Parsing with Large Scale Automatically Constructed Case Structures , 2008, COLING.

[22]  Kentaro Torisawa,et al.  Improving Dependency Parsing with Subtrees from Auto-Parsed Data , 2009, EMNLP.

[23]  Michael Collins,et al.  Discriminative Training Methods for Hidden Markov Models: Theory and Experiments with Perceptron Algorithms , 2002, EMNLP.