A Tractable Extension of Linear Indexed Grammars
cmp-lg
2008-02-03 v1 Computation and Language
Abstract
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.
Keywords
Cite
@article{arxiv.cmp-lg/9502021,
title = {A Tractable Extension of Linear Indexed Grammars},
author = {Bill Keller and David Weir},
journal= {arXiv preprint arXiv:cmp-lg/9502021},
year = {2008}
}
Comments
8 pages LaTeX, uses eaclap.sty, to appear in EACL-95