A Tractable Extension of Linear Indexed Grammars

Simple item page
dc.creatorKeller, Bill
dc.creatorWeir, David
dc.date1995-02-17
dc.date.accessioned2026-07-07T09:09:42Z
dc.date.available2026-07-07T09:09:42Z
dc.descriptionIt 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.
dc.description8 pages LaTeX, uses eaclap.sty, to appear in EACL-95
dc.identifierhttps://arxiv.org/abs/cmp-lg/9502021
dc.identifierhttp://arxiv.org/abs/cmp-lg/9502021
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/151132
dc.subjectComputation and Language
dc.titleA Tractable Extension of Linear Indexed Grammars
dc.typetext

Files

Collections

arXiv