Indexed Languages and Unification Grammars

Simple item page
dc.creatorBurheim, Tore
dc.date1995-07-24
dc.date.accessioned2026-07-07T09:09:57Z
dc.date.available2026-07-07T09:09:57Z
dc.descriptionIndexed 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.
dc.description16 pages uuencodet gnu-compressed PostScript format. Also in Proceedings of the 10th Nordic Conference of Computational Linguistics, NODALIDA-95, Helsinki, 1995
dc.identifierhttps://arxiv.org/abs/cmp-lg/9507013
dc.identifierhttp://arxiv.org/abs/cmp-lg/9507013
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/151221
dc.subjectComputation and Language
dc.titleIndexed Languages and Unification Grammars
dc.typetext

Files

Collections

arXiv