A Datalog recognizer for almost affine lambda-CFGs

Pierre Bourreau 1 Sylvain Salvati 2, 3
3 SIGNES - Linguistic signs, grammar and meaning: computational logic for natural language
Université Michel de Montaigne - Bordeaux 3, Université Sciences et Technologies - Bordeaux 1, Inria Bordeaux - Sud-Ouest, École Nationale Supérieure d'Électronique, Informatique et Radiocommunications de Bordeaux (ENSEIRB), CNRS - Centre National de la Recherche Scientifique : UMR5800
Abstract : 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.
Type de document :
Communication dans un congrès
Springer. Mathematics of Language, Sep 2011, Nara, Japan. 6878, pp.21-38, 2011, <10.1007/978-3-642-23211-4>


https://hal.archives-ouvertes.fr/hal-00740701
Contributeur : Pierre Bourreau <>
Soumis le : mercredi 10 octobre 2012 - 16:44:46
Dernière modification le : mercredi 9 septembre 2015 - 16:36:25
Document(s) archivé(s) le : vendredi 11 janvier 2013 - 03:42:18

Fichier

parseAffine.pdf
Fichiers produits par l'(les) auteur(s)

Identifiants

Collections

Citation

Pierre Bourreau, Sylvain Salvati. A Datalog recognizer for almost affine lambda-CFGs. Springer. Mathematics of Language, Sep 2011, Nara, Japan. 6878, pp.21-38, 2011, <10.1007/978-3-642-23211-4>. <hal-00740701>

Exporter

Partager

Métriques

Consultations de
la notice

227

Téléchargements du document

156