A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is
Proceedings of the seventh conference on European chapter of the Association for Computational Linguistics -
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.doi:10.3115/976973.976985 fatcat:agq7vgwyrbez5bgab6fq2ltcnu