AUTOMATA-BASED PARSING IN DYNAMIC PROGRAMMING FOR LINEAR INDEXED GRAMMARS

A general framework for the development of parsing algorithms in dynamic programming for Linear Indexed Grammars (LIG) is derived from the concept of Logic Push-down Automata (LPDA), an operational device for the construction of parsers for logic grammars. By exploiting several properties of the LIG formalism, we can guarantee both termination and completeness, which is not possible in the general case of logic grammars. In this paper we center our attention on the class of weakly predictive parsing strategies, which include bottom-up algorithms. The interpretation in dynamic programming of parsing algorithms belonging to this class can be performed in O(n) complexity, which is the lower bound achieved for LIG. In this context, a version for LIG of the LR parsing strategy is developed. The results are also applicable to other automata-based strategies, such as Left Corner.

[1]  Yves Schabes,et al.  Stochastic Lexicalized Tree-adjoining Grammars , 1992, COLING.

[2]  David J. Weir,et al.  Polynomial Parsing of Extensions of Context-Free Grammars , 1991 .

[3]  Andrew R. Haas,et al.  A Parsing Algorithm for Unification Grammar , 1989, Comput. Linguistics.

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

[5]  Miguel A. Alonso,et al.  An LALR Extension for DCGs in Dynamic Programming , 1996, APPIA-GULP-PRODE.

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

[7]  Stuart M. Shieber,et al.  Using Restriction to Extend Parsing Algorithms for Complex-Feature-Based Formalisms , 1985, ACL.

[8]  Alfred V. Aho,et al.  The Theory of Parsing, Translation, and Compiling , 1972 .

[9]  Yves Schabes,et al.  Polynomial Time and Space Shift-Reduce Parsing of Arbitrary Context-free Grammars , 1991, ACL.

[10]  David H. D. Warren,et al.  Parsing as Deduction , 1983, ACL.

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

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

[13]  Manuel Vilares Ferro,et al.  Efficient incremental parsing for context-free languages , 1994, Proceedings of 1994 IEEE International Conference on Computer Languages (ICCL'94).

[14]  Éric Villemonte de la Clergerie,et al.  Subsumption-oriented Push-Down Automata , 1992, PLILP.

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

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

[17]  Éric Villemonte de la Clergerie,et al.  LPDA: Another look at Tabulation in Logic Programming , 1994, ICLP.

[18]  Masaru Tomita,et al.  Efficient parsing for natural language , 1985 .

[19]  Bernard Lang,et al.  Towards a Uniform Formal Framework for Parsing , 1991 .

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