Words as modules: a lexicalised grammar in the framework of linear logic proof nets. - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 1998

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

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.
No file

Dates and versions

inria-00098440 , version 1 (25-09-2006)

Identifiers

  • HAL Id : inria-00098440 , version 1

Cite

Alain Lecomte, Christian Retoré. Words as modules: a lexicalised grammar in the framework of linear logic proof nets.. Mathematical & Computational Analysis of Natural Language (Proceedings of International conference on mathematical linguistics II), 1998, Tarragone, pp.129-144. ⟨inria-00098440⟩
97 View
0 Download

Share

Gmail Facebook X LinkedIn More