A Datalog recognizer for almost affine lambda-CFGsReportar como inadecuado

A Datalog recognizer for almost affine lambda-CFGs - Descarga este documento en PDF. Documentación en PDF para descargar gratis. Disponible también para leer online.

1 LaBRI - Laboratoire Bordelais de Recherche en Informatique 2 Inria Bordeaux - Sud-Ouest 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.

keyword : abstract categorial grammars lambda-calculus context-free lambda-grammars datalog deleting grammars

. parsing typing properties

Autor: Pierre Bourreau - Sylvain Salvati -

Fuente: https://hal.archives-ouvertes.fr/


Documentos relacionados