Labelled Proof Nets for the Syntax and Semantics of Natural Languages - Inria - Institut national de recherche en sciences et technologies du numérique Accéder directement au contenu
Article Dans Une Revue Logic Journal of the IGPL Année : 1999

Labelled Proof Nets for the Syntax and Semantics of Natural Languages

Résumé

We propose to represent the syntax and semantics of natural languages with labelled proof nets in the implicative fragment of intuitionistic linear logic. Resource-sensitivity of linear logic is used to express all dependencies between the syntactic constituents of a sentence in the form of a proof net. Phonological and semantic labelling of the proof net from its inputs to the unique output are used to produce the well-formed phonological form and the semantic representation of a sentence from entries of a lexicon. In this way we obtain a linguistic model of great flexibility because labelling is not completely determined logically: it is used to introduce linguistic constraints which go beyond the underlying logic.
Fichier non déposé

Dates et versions

inria-00099011 , version 1 (26-09-2006)

Identifiants

  • HAL Id : inria-00099011 , version 1

Citer

Guy Perrier. Labelled Proof Nets for the Syntax and Semantics of Natural Languages. Logic Journal of the IGPL, 1999, 7 (5), pp.629-654. ⟨inria-00099011⟩
114 Consultations
0 Téléchargements

Partager

Gmail Facebook X LinkedIn More