Lexical Semantics with Linear Types

12 pages•Published: July 7, 2015

Abstract

We have proposed a framework based upon the λ -calculus with higher-order intuitionistic types for the symbolic computation of the semantic analysis, integrating lexical data. This proposal is sufficient for many phenomena and accurately incorporates lexical semantics by the means of type theory, but some issues linger in the linguistic data. In the present paper, we revisit this proposal with a version of the λ -calculus based upon higher-order linear types, that aims to resolve those issues and present an integrated framework for meaning assembly.

Keyphrases: compositional semantics, higher order linear intuitionistic logic, lambda calculus, lexical semantics

In: Makoto Kanazawa, Lawrence S. Moss and Valeria de Paiva (editors). NLCS'15. Third Workshop on Natural Language and Computer Science, vol 32, pages 39-50.

Links:	https://easychair.org/publications/paper/xXH1
	https://doi.org/10.29007/16s8

BibTeX entry

@inproceedings{NLCS'15:Lexical_Semantics_with_Linear,
  author    = {Bruno Mery},
  title     = {Lexical Semantics with Linear Types},
  booktitle = {NLCS'15. Third Workshop on Natural Language and Computer Science},
  editor    = {Makoto Kanazawa and Lawrence S. Moss and Valeria de Paiva},
  series    = {EPiC Series in Computing},
  volume    = {32},
  publisher = {EasyChair},
  bibsource = {EasyChair, https://easychair.org},
  issn      = {2398-7340},
  url       = {/publications/paper/xXH1},
  doi       = {10.29007/16s8},
  pages     = {39-50},
  year      = {2015}}

Download PDF Open PDF in browser