Words as modules: a lexicalised grammar in the framework of linear logic proof nets.

Alain Lecomte 1 Christian Retoré
1 CALLIGRAMME - Linear logic, proof networks and categorial grammars
INRIA Lorraine, LORIA - Laboratoire Lorrain de Recherche en Informatique et ses Applications
Abstract : We present a syntactic calculus relying on the notion of proof net, ie. a geometric representation for proofs in linear logic. The lexicon associates a module or partial proof net with each word, and this information completely encodes the syntactic behavior of the word. Parsing a sentence consists in combining the modules associated withits words into a complete proof net. In order to handle word order, this model takes place in a non-commutative extension of linear logic called Pomset logic.
Type de document :
Communication dans un congrès
Carlos Martin-Vide. Mathematical & Computational Analysis of Natural Language (Proceedings of International conference on mathematical linguistics II), 1998, Tarragone, John Benjamins, 45, pp.129-144, 1998
Liste complète des métadonnées

https://hal.inria.fr/inria-00098440
Contributeur : Publications Loria <>
Soumis le : lundi 25 septembre 2006 - 17:01:30
Dernière modification le : jeudi 11 janvier 2018 - 06:19:48

Identifiants

  • HAL Id : inria-00098440, version 1

Collections

Citation

Alain Lecomte, Christian Retoré. Words as modules: a lexicalised grammar in the framework of linear logic proof nets.. Carlos Martin-Vide. Mathematical & Computational Analysis of Natural Language (Proceedings of International conference on mathematical linguistics II), 1998, Tarragone, John Benjamins, 45, pp.129-144, 1998. 〈inria-00098440〉

Partager

Métriques

Consultations de la notice

112