hal-00740701, version 1
A Datalog recognizer for almost affine lambda-CFGs
Pierre Bourreau
1Sylvain Salvati
1, 2
Mathematics of Language 6878 (2011) 21-38
Résumé : 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.
- 1 : Laboratoire Bordelais de Recherche en Informatique (LaBRI)
- CNRS : UMR5800 – Université Sciences et Technologies - Bordeaux I – École Nationale Supérieure d'Électronique, Informatique et Radiocommunications de Bordeaux (ENSEIRB) – Université Victor Segalen - Bordeaux II
- 2 : INRIA Bordeaux - Sud-Ouest (INRIA Bordeaux - Sud-Ouest)
- INRIA
- Domaine : Informatique/Informatique et langage
- Mots-clés : abstract categorial grammars – lambda-calculus – context-free lambda-grammars – datalog – deleting grammars... parsing – typing properties
- hal-00740701, version 1
- http://hal.archives-ouvertes.fr/hal-00740701
- oai:hal.archives-ouvertes.fr:hal-00740701
- Contributeur : Pierre Bourreau
- Soumis le : Mercredi 10 Octobre 2012, 16:44:46
- Dernière modification le : Mercredi 10 Octobre 2012, 16:54:05
Documents associés
Exporter