Efficient Parsing of Well-Nested Linear Context-Free Rewriting Systems

The use of well-nested linear context-free rewriting systems has been empirically motivated for modeling of the syntax of languages with discontinuous constituents or relatively free word order. We present a chart-based parsing algorithm that asymptotically improves the known running time upper bound for this class of rewriting systems. Our result is obtained through a linear space construction of a binary normal form for the grammar at hand.

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

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

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

[4]  Giorgio Satta,et al.  Recognition of Linear Context-Free Rewriting Systems , 1992, ACL.

[5]  Klaas Sikkel,et al.  Parsing Schemata: A Framework for Specification and Analysis of Parsing Algorithms , 2002 .

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

[7]  Günter Hotz,et al.  On Parsing Coupled-Context-Free Languages , 1996, Theor. Comput. Sci..

[8]  Makoto Kanazawa.  The Pumping Lemma for Well-Nested Multiple Context-Free Languages , 2009, Developments in Language Theory.

[9]  Daniel Götzmann.  Multiple Context-Free Grammars , 2007 .

[10]  Wolfgangmaier Andanderssøgaard,et al.  Treebanks and Mild Context-Sensitivity , 2008 .

[11]  Timm Lichte,et al.  Characterizing Discontinuity in Constituent Treebanks , 2009, FG.

[12]  Giorgio Satta,et al.  Optimal Reduction of Rule Length in Linear Context-Free Rewriting Systems , 2009, NAACL.

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

[14]  Daniel Gildea,et al.  Optimal Parsing Strategies for Linear Context-Free Rewriting Systems , 2010, NAACL.

[15]  Eric Villemonte de la Clergerie.  Parsing Mildly Context-Sensitive Languages with Thread Automata , 2002, COLING.

[16]  Giorgio Satta,et al.  Independent Parallelism in Finite Copying Parallel Rewriting Systems , 1999, Theor. Comput. Sci..

[17]  Laura Kallmeyer,et al.  An Incremental Earley Parser for Simple Range Concatenation Grammar , 2009, IWPT.

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

[19]  Makoto Kanazawa,et al.  The Copying Power of Well-Nested Multiple Context-Free Grammars , 2010, LATA.

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

[21]  Marco Kuhlmann,et al.  Mildly Context-Sensitive Dependency Languages , 2007, ACL.

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