Pumping, Shrinking and Pronouns: From Context Free to Indexed Grammars

Pumping-shrinking operation is a useful tool in the study of Formal Languages. A pump-shrink bound for Linear Indexed Grammars is derived, depending only on the the number of auxiliary symbols of the grammar. Observations are suggested on formal operations analogous to shrinking of subordinate clauses.

[1]  Eliahu Shamir,et al.  Some Inherently Ambiguous Context-Free Languages , 1971, Inf. Control..

[2]  Yoav Seginer,et al.  Fast Unsupervised Incremental Parsing , 2007, ACL.

[3]  David J. Weir,et al.  The equivalence of four extensions of context-free grammars , 1994, Mathematical systems theory.

[4]  Peter Staudacher,et al.  New Frontiers Beyond Context-Freeness: Di-Grammars and Di-Automata. , 1993, EACL.

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

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

[7]  Robert H. Gilman.  A Shrinking Lemma for Indexed Languages , 1996, Theor. Comput. Sci..

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

[9]  Bill Keller,et al.  A Tractable Extension of Linear Indexed Grammars , 1995, EACL.

[10]  Gerald Gazdar,et al.  Applicability of Indexed Grammars to Natural Languages , 1988 .

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

[12]  Uwe Reyle,et al.  Natural Language Parsing and Linguistic Theories , 1988 .

[13]  William F. Ogden.  Intercalation theorems for stack languages , 1969, STOC '69.

[14]  Takeshi Hayashi.  On Derivation Trees of Indexed Grammars —An Extension of the uvwxy-Theorem— , 1973 .

[15]  David J. Weir,et al.  Parsing Some Constrained Grammar Formalisms , 1993, Comput. Linguistics.

[16]  Aravind K. Joshi,et al.  A study of tree adjoining grammars , 1987 .

[17]  Alfred V. Aho,et al.  Indexed Grammars—An Extension of Context-Free Grammars , 1967, SWAT.