Tore Burheim. Indexed Languages and Unification Grammars. Technical report, CLAUS-Report 63, Unversität des Saarlandes, Saarbrücken, May 1995. [Abstract] [Annote]
@TechReport{Burheim:1995_1,
AUTHOR = {Burheim, Tore},
TITLE = {Indexed Languages and Unification Grammars},
YEAR = {1995},
MONTH = {May},
NUMBER = {63},
PAGES = {16},
ADDRESS = {Saarbrücken},
TYPE = {CLAUS-Report},
INSTITUTION = {Unversität des Saarlandes},
URL = {ftp://ftp.coli.uni-sb.de/pub/coli/claus/claus63.ps},
ABSTRACT = {Indexed languages are interesting in computational linguistics because they are the least class of languages in the Chomsky hierarchy that has not been shown not to be adequate to describe the string set of natural language sentences. We here define a class of unification grammars that exactly describe the class of indexed languages.},
ANNOTE = {COLIURL : Burheim:1995:ILU.pdf Burheim:1995:ILU.ps} }
|