A Datalog recognizer for almost affine lambda-CFGs
| hal.structure.identifier | Laboratoire Bordelais de Recherche en Informatique [LaBRI] | |
| dc.contributor.author | BOURREAU, Pierre | |
| hal.structure.identifier | Linguistic signs, grammar and meaning: computational logic for natural language [SIGNES] | |
| dc.contributor.author | SALVATI, Sylvain | |
| dc.contributor.editor | Springer | |
| dc.date.accessioned | 2024-04-15T09:44:32Z | |
| dc.date.available | 2024-04-15T09:44:32Z | |
| dc.date.created | 2011-04-02 | |
| dc.date.issued | 2011-09-06 | |
| dc.date.conference | 2011-09-06 | |
| dc.identifier.uri | https://oskar-bordeaux.fr/handle/20.500.12278/197854 | |
| dc.description.abstractEn | The 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.iso | en | |
| dc.type | Communication dans un congrès | |
| dc.identifier.doi | 10.1007/978-3-642-23211-4 | |
| dc.subject.hal | Informatique [cs]/Informatique et langage [cs.CL] | |
| bordeaux.page | 21-38 | |
| bordeaux.volume | 6878 | |
| bordeaux.hal.laboratories | Laboratoire Bordelais de Recherche en Informatique (LaBRI) - UMR 5800 | * |
| bordeaux.institution | Université de Bordeaux | |
| bordeaux.institution | Bordeaux INP | |
| bordeaux.institution | CNRS | |
| bordeaux.conference.title | Mathematics of Language | |
| bordeaux.country | JP | |
| bordeaux.conference.city | Nara | |
| bordeaux.peerReviewed | oui | |
| hal.identifier | hal-00740701 | |
| hal.version | 1 | |
| hal.invited | non | |
| hal.proceedings | oui | |
| hal.conference.end | 2011-09-08 | |
| hal.popular | non | |
| hal.audience | Internationale | |
| dc.subject.it | typing properties | |
| dc.subject.it | deleting grammars... parsing | |
| dc.subject.it | lambda-calculus | |
| dc.subject.it | abstract categorial grammars | |
| dc.subject.it | context-free lambda-grammars | |
| dc.subject.it | datalog | |
| dc.title.it | A Datalog recognizer for almost affine lambda-CFGs | |
| hal.origin.link | https://hal.archives-ouvertes.fr//hal-00740701v1 | |
| bordeaux.COinS | ctx_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 |
Fichier(s) constituant ce document
| Fichiers | Taille | Format | Vue |
|---|---|---|---|
|
Il n'y a pas de fichiers associés à ce document. |
|||