PASCAL - Pattern Analysis, Statistical Modelling and Computational Learning

Unsupervised Induction of Tree Substitution Grammars for Dependency Parsing
Phil Blunsom and Trevor Cohn
In: EMNLP 2010, 9-11 Oct 2010, Boston, Cambridge, MA, USA.


Inducing a grammar directly from text is one of the oldest and most challenging tasks in Computational Linguistics. Significant progress has been made for inducing dependency grammars, however the models employed are overly simplistic, particularly in comparison to supervised parsing models. In this paper we present an approach to dependency grammar induction using tree substitution grammar which is capable of learn- ing large dependency fragments and thereby better modelling the text. We define a hierarchical non-parametric Pitman-Yor Process prior which biases towards a small grammar with simple productions. This approach significantly improves the state-of-the-art, when measured by head attachment accuracy

EPrint Type:Conference or Workshop Item (Paper)
Project Keyword:Project Keyword UNSPECIFIED
Subjects:Natural Language Processing
ID Code:8136
Deposited By:Trevor Cohn
Deposited On:29 April 2011