Highly Constrained Unification Grammars

Unification grammars are widely accepted as an expressive means for describing the structure of natural languages. In general, the recognition problem is undecidable for unification grammars. Even with restricted variants of the formalism, offline parsable grammars, the problem is computationally hard. We present two natural constraints on unification grammars which limit their expressivity. We first show that non-reentrant unification grammars generate exactly the class of context-free languages. We then relax the constraint and show that one-reentrant unification grammars generate exactly the class of tree-adjoining languages. We thus relate the commonly used and linguistically motivated formalism of unification grammars to more restricted, computationally tractable classes of languages.

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

[2]  Robert C. Berwick,et al.  Computational complexity and natural language , 1987 .

[3]  Nissim Francez,et al.  Unification Grammars and Off-Line Parsability , 2005, J. Log. Lang. Inf..

[4]  Mark Steedman,et al.  The syntactic process , 2004, Language, speech, and communication.

[5]  S. Wintner.  Unification: Computational Issues , 2006 .

[6]  Shuly Wintner,et al.  Introduction to Unification Grammars , 2006, Recent Advances in Formal Languages and Applications.

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

[8]  Rebecca N. Wright,et al.  Finite-State Approximation of Phrase Structure Grammars , 1991, ACL.

[9]  Giorgio Satta,et al.  Tree-Adjoining Grammar Parsing and Boolean Matrix Multiplication , 1994, Comput. Linguistics.

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

[11]  Stuart M. Shieber,et al.  Constraint-based grammar formalisms - parsing and type inference for natural and computer languages , 1992 .

[12]  Stuart M. Shieber,et al.  An Introduction to Unification-Based Approaches to Grammar , 1986, CSLI Lecture Notes.

[13]  Mark Johnson,et al.  Finite-state Approximation of Constraint-based Grammars using Left-corner Grammar Transforms , 1998, ACL.

[14]  Beth Ann Hockey,et al.  A baseline method for compiling typed unification grammars into context free language models , 2001, INTERSPEECH.

[15]  Bob Carpenter,et al.  The logic of typed feature structures , 1992 .

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

[17]  Mark Johnson,et al.  Attribute-value logic and the theory of grammar , 1988 .

[18]  Alexis Manaster-Ramer,et al.  Review of The formal complexity of natural language by Walter J. Savitch, Emmon Bach, William Marsh, and Gila Safran-Naveh. D. Reidel 1987. , 1988 .

[19]  Hans-Ulrich Krieger,et al.  A context-free superset approximation of unification-based grammars , 2004 .

[20]  Stuart M. Shieber,et al.  Constraint-based grammar formalisms , 1992 .

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

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

[23]  Aravind K. Joshi,et al.  Tree-Adjoining Grammars , 1997, Handbook of Formal Languages.

[24]  Bob Carpenter.  Logic of Typed Feature Structures, The (Cambridge Tracts in Theoretical Computer Science) , 2005 .

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

[26]  David J. Weir.  A Geometric Hierarchy Beyond Context-Free Languages , 1992, Theor. Comput. Sci..

[27]  Carl Jesse Pollard,et al.  Generalized phrase structure grammars, head grammars, and natural language , 1984 .