Mostrar el registro sencillo del ítem

A Datalog recognizer for almost affine lambda-CFGs

hal.structure.identifierLaboratoire Bordelais de Recherche en Informatique [LaBRI]
dc.contributor.authorBOURREAU, Pierre
hal.structure.identifierLinguistic signs, grammar and meaning: computational logic for natural language [SIGNES]
dc.contributor.authorSALVATI, Sylvain
dc.contributor.editorSpringer
dc.date.accessioned2024-04-15T09:44:32Z
dc.date.available2024-04-15T09:44:32Z
dc.date.created2011-04-02
dc.date.issued2011-09-06
dc.date.conference2011-09-06
dc.identifier.urihttps://oskar-bordeaux.fr/handle/20.500.12278/197854
dc.description.abstractEnThe recent emergence of linguistic formalisms exclusively based on the simply-typed λ-calculus to represent both syntax and semantics led to the presentation of innovative techniques which apply to both the problems of parsing and generating natural languages. A common feature of these techniques consists in using strong relations between typing properties and syntactic structures of families of simply-typed λ-terms. Among significant results, an efficient algorithm based on Datalog programming is presented in [Kan07] for context-free grammar of almost linear λ-terms, which are linear λ-terms augmented with a restricted form of copy. We present an extension of this method to terms for which deletion is allowed.
dc.language.isoen
dc.typeCommunication dans un congrès
dc.identifier.doi10.1007/978-3-642-23211-4
dc.subject.halInformatique [cs]/Informatique et langage [cs.CL]
bordeaux.page21-38
bordeaux.volume6878
bordeaux.hal.laboratoriesLaboratoire Bordelais de Recherche en Informatique (LaBRI) - UMR 5800*
bordeaux.institutionUniversité de Bordeaux
bordeaux.institutionBordeaux INP
bordeaux.institutionCNRS
bordeaux.conference.titleMathematics of Language
bordeaux.countryJP
bordeaux.conference.cityNara
bordeaux.peerReviewedoui
hal.identifierhal-00740701
hal.version1
hal.invitednon
hal.proceedingsoui
hal.conference.end2011-09-08
hal.popularnon
hal.audienceInternationale
dc.subject.ittyping properties
dc.subject.itdeleting grammars... parsing
dc.subject.itlambda-calculus
dc.subject.itabstract categorial grammars
dc.subject.itcontext-free lambda-grammars
dc.subject.itdatalog
dc.title.itA Datalog recognizer for almost affine lambda-CFGs
hal.origin.linkhttps://hal.archives-ouvertes.fr//hal-00740701v1
bordeaux.COinSctx_ver=Z39.88-2004&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.date=2011-09-06&rft.volume=6878&rft.spage=21-38&rft.epage=21-38&rft.au=BOURREAU,%20Pierre&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