A Tractable Extension of Linear Indexed Grammars

  title={A Tractable Extension of Linear Indexed Grammars},
  author={Bill Keller and David J. Weir},
Vijay-Shanker and Weir (1993) show that Linear Indexed Grammars (I_IG) can be processed in polynomial time by exploiting constraints which make possible the extensive use of structure-sharing. This paper describes a formalism that is more powerful than I_IG, but which can also be processed in polynomial time using similar techniques. The formalism, which we refer to as Partially Linear PATR (PI_PATR) manipulates feature structures rather than stacks. 1 I n t r o d u c t i o n Unification-based… CONTINUE READING


Publications referenced by this paper.
Showing 1-10 of 16 references

Parsing Some Constrained Grammar Formalisms

Computational Linguistics • 1993
View 1 Excerpt

Lazy Unification

ACL • 1990
View 1 Excerpt

Using restrictions to optimize unification parsing

Dale Gerdemann.
International Workshop of Parsing Technologies, pages 8-17, Pittsburgh, PA. • 1989
View 1 Excerpt

Applicability of indexed grammars to natural languages

G. Gazdar.
U. Reyle and C. Rohrer, editors, Natural Language Parsing and Linguistic Theories, pages 69--94. D. Reidel, Dordrecht, Holland. • 1988

Similar Papers

Loading similar papers…