Parsing Beyond Context-Free Grammars

Given that context-free grammars (CFG) cannot adequately describe natural languages, grammar formalisms beyond CFG that are still computationally tractable are of central interest for computational linguists. This book provides an extensive overview of the formal language landscape between CFG and PTIME, moving from Tree Adjoining Grammars to Multiple Context-Free Grammars and then to Range Concatenation Grammars while explaining available parsing techniques for these formalisms. Although familiarity with the basic notions of parsing and formal languages is helpful when reading this book, it is not a strict requirement. The presentation is supported with many illustrations and examples relating to the different formalisms and algorithms, and chapter summaries, problems and solutions. The book will be useful for students and researchers in computational linguistics and in formal language theory.

[1]  Tadao Kasami,et al.  On Multiple Context-Free Grammars , 1991, Theor. Comput. Sci..

[2]  Mark-Jan Nederhof.  Solving the Correct-prefix Property for TAGs , 1997 .

[3]  Aravind K. Joshi,et al.  Some Computational Properties of Tree Adjoining Grammars , 1985, ACL.

[4]  Aravind K. Joshi,et al.  Lr parsing for tree adjoining grammars and its application to corpus-based natural language parsing , 2003 .

[5]  Éric Villemonte de la Clergerie.  Parsing Mildly Context-Sensitive Languages with Thread Automata , 2002, COLING.

[6]  Aravind K. Joshi,et al.  Tree Adjunct Grammars , 1975, J. Comput. Syst. Sci..

[7]  David J. Weir,et al.  Characterizing mildly context-sensitive grammar formalisms , 1988 .

[8]  Aravind K. Joshi,et al.  An Earley-Type Parsing Algorithm for Tree Adjoining Grammars , 1988, ACL.

[9]  K. Vijay-Shankar,et al.  SOME COMPUTATIONAL PROPERTIES OF TREE ADJOINING GRAMMERS , 1985, ACL 1985.

[10]  守屋 悦朗,et al.  J.E.Hopcroft, J.D. Ullman 著, "Introduction to Automata Theory, Languages, and Computation", Addison-Wesley, A5変形版, X+418, \6,670, 1979 , 1980 .

[11]  Mark-Jan Nederhof,et al.  An Alternative LR Algorithm for TAGs , 1998, COLING-ACL.

[12]  Giorgio Satta,et al.  A Polynomial-Time Parsing Algorithm for TT-MCTAG , 2009, ACL/IJCNLP.

[13]  Jeffrey D. Ullman,et al.  Introduction to Automata Theory, Languages and Computation , 1979 .

[14]  Laura Kallmeyer,et al.  Un Algorithme d'Analyse de Type Earley pour Grammaires à Concaténation d'Intervalles , 2009 .

[15]  Stuart M. Shieber,et al.  Principles and Implementation of Deductive Parsing , 1994, J. Log. Program..

[16]  Håkan Burden,et al.  Parsing Linear Context-Free Rewriting Systems , 2005, IWPT.

[17]  Stuart M. Shieber,et al.  Evidence against the context-freeness of natural language , 1985 .

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

[19]  Pierre Boullier.  A Proposal for a Natural Lan-guage Processing Syntactic Backbone , 1997 .

[20]  Pierre Boullier,et al.  Range Concatenation Grammars , 2000, IWPT.

[21]  Walter J. Savitch,et al.  The Formal Complexity of Natural Language , 1987 .