Syntactic Analysis by Local Grammars Automata: an Efficient Algorithm

Simple item page
dc.creatorMohri, Mehryar
dc.date1994-07-04
dc.date.accessioned2026-07-07T09:09:23Z
dc.date.available2026-07-07T09:09:23Z
dc.descriptionLocal grammars can be represented in a very convenient way by automata. This paper describes and illustrates an efficient algorithm for the application of local grammars put in this form to lemmatized texts.
dc.description13 pages,Postscript uuencoded,to appear in Proceedings of COMPLEX '94
dc.identifierhttps://arxiv.org/abs/cmp-lg/9407002
dc.identifierhttp://arxiv.org/abs/cmp-lg/9407002
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/151018
dc.subjectComputation and Language
dc.titleSyntactic Analysis by Local Grammars Automata: an Efficient Algorithm
dc.typetext

Files

Collections

arXiv