El sistema se apagará debido a tareas habituales de mantenimiento. Por favor, guarde su trabajo y desconéctese.

Mostrar el registro sencillo del ítem

Parsing TAG with Abstract Categorial Grammar.

hal.structure.identifierLinguistic signs, grammar and meaning: computational logic for natural language [SIGNES]
dc.contributor.authorSALVATI, Sylvain
dc.date.accessioned2024-04-15T09:54:07Z
dc.date.available2024-04-15T09:54:07Z
dc.date.issued2006
dc.date.conference2006
dc.identifier.urihttps://oskar-bordeaux.fr/handle/20.500.12278/198646
dc.description.abstractEnThis paper presents informally an Earley algorithm for TAG which behaves as the algorithm given by [SJ88]. This algorithm is a specialization to TAG of a more general algorithm dedicated to second order ACGs. As second order ACGs allows to encode Linear Context Free Rewriting Systems (LCFRS) [dGP04], the main purpose of this paper is to give a rough presentation of formal tools which can be used to design efficient algorithms for LCFRS.
dc.language.isoen
dc.title.enParsing TAG with Abstract Categorial Grammar.
dc.typeCommunication dans un congrès
dc.subject.halInformatique [cs]/Informatique et langage [cs.CL]
bordeaux.hal.laboratoriesLaboratoire Bordelais de Recherche en Informatique (LaBRI) - UMR 5800*
bordeaux.institutionUniversité de Bordeaux
bordeaux.institutionBordeaux INP
bordeaux.institutionCNRS
bordeaux.conference.titleTAG+8: Workshop On Tree Adjoining Grammar And Related Formalisms
bordeaux.countryAU
bordeaux.conference.citySidney
bordeaux.peerReviewedoui
hal.identifierinria-00334009
hal.version1
hal.invitednon
hal.proceedingsnon
hal.popularnon
hal.audienceInternationale
hal.origin.linkhttps://hal.archives-ouvertes.fr//inria-00334009v1
bordeaux.COinSctx_ver=Z39.88-2004&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.date=2006&rft.au=SALVATI,%20Sylvain&rft.genre=unknown


Archivos en el ítem

ArchivosTamañoFormatoVer

No hay archivos asociados a este ítem.

Este ítem aparece en la(s) siguiente(s) colección(ones)

Mostrar el registro sencillo del ítem