A Datalog recognizer for almost affine lambda-CFGs
Langue
en
Communication dans un congrès
Ce document a été publié dans
Mathematics of Language, 2011-09-06, Nara. 2011-09-06, vol. 6878, p. 21-38
Résumé en anglais
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 ...Lire la suite >
Mots clés en italien
typing properties
deleting grammars... parsing
lambda-calculus
abstract categorial grammars
context-free lambda-grammars
datalog