Computer Science – Computation and Language
Scientific paper
1995-02-17
Computer Science
Computation and Language
8 pages LaTeX, uses eaclap.sty, to appear in EACL-95
Scientific paper
It has been shown that Linear Indexed Grammars 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 Linear Indexed Grammar, but which can also be processed in polynomial time using similar techniques. The formalism, which we refer to as Partially Linear PATR manipulates feature structures rather than stacks.
Keller Bill
Weir David
No associations
LandOfFree
A Tractable Extension of Linear Indexed Grammars does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with A Tractable Extension of Linear Indexed Grammars, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and A Tractable Extension of Linear Indexed Grammars will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-464486