Expressive Power and Consistency Properties of State-of-the-Art Natural Language Parsers

We define Probabilistic Constrained W-grammars (PCW-grammars), a two-level formalism capable of capturing grammatical frameworks used in two state of the art parsers, namely bilexical grammars and stochastic tree substitution grammars. We provide embeddings of these parser formalisms into PCW-grammars, which allows us to derive properties about their expressive power and consistency, and relations between the formalisms studied.

[1]  Maarten de Rijke,et al.  Alternative approaches for Generating Bodies of Grammar Rules , 2004, ACL.

[2]  Jason Eisner,et al.  Bilexical Grammars and their Cubic-Time Parsing Algorithms , 2000 .

[3]  Michael Collins,et al.  Three Generative, Lexicalised Models for Statistical Parsing , 1997, ACL.

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

[5]  M. de Rijke,et al.  Comparing the Ambiguity Reduction Abilities of Probabilistic Context-Free Grammars , 2004, LREC.

[6]  O. Kiselyov.  Categorial Grammars , 2006 .

[7]  Rens Bod,et al.  Beyond Grammar: An Experience-Based Theory of Language , 1998 .

[8]  Hendrik Blockeel,et al.  Machine Learning: ECML 2003 , 2003, Lecture Notes in Computer Science.

[9]  Michael Collins,et al.  Review of Beyond grammar: an experience-based theory of language by Rens Bod. CSLI Publications 1998. , 1999 .

[10]  A. vanWijngaarden,et al.  Orthogonal design and description of a formal language , 1965 .

[11]  Harry Bunt,et al.  Advances in Probabilistic and Other Parsing Technologies , 2000 .

[12]  Khalil Sima'an,et al.  Backoff Parameter Estimation for the DOP Model , 2003, ECML.

[13]  Joan-Andreu Sánchez,et al.  Consistency of Stochastic Context-Free Grammars From Probabilistic Estimation Based on Growth Transformations , 1997, IEEE Trans. Pattern Anal. Mach. Intell..

[14]  David R. Dowty,et al.  Natural Language Parsing , 2005 .

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

[16]  Mark Johnson.  The DOP Estimation Method Is Biased and Inconsistent , 2002, Computational Linguistics.

[17]  Zhiyi Chi,et al.  Estimation of Probabilistic Context-Free Grammars , 1998, Comput. Linguistics.