Skip to Main content Skip to Navigation

Automatisation de la Construction Sémantique dans le Lambda Calcul Simplement Typé avec plusieurs Types de base

Sébastien Hinderer 1
1 TALARIS - Natural Language Processing: representation, inference and semantics
Inria Nancy - Grand Est, LORIA - Laboratoire Lorrain de Recherche en Informatique et ses Applications
Abstract : This thesis discusses the automatic construction of semantic representations as simply typed lambda termes. We introduce non-formal and formal semantics and present one attempt to build semantic representations with the help of reasonning tools. We explain why we find this approach limited and propose our own, at the heart of which is a tool called Nessie. This tool builds semantic representations using a lexicon specifying representations for words and a tree to guide semantic consruction. We present the implementation of this tool in detail, and compare its results with an earlier systme. We then apply Nessie to two different tasks.
First we show how it can be used (in conjunction with inference tools) to study the semantics of tense and apsect of Polish verbs. Second, we present two different type-theoretic approaches to the compositional computation of discourse semantics. We show that Nessie can be used to compute discourse representations in both formalisms; this dual implementation enables us to evaluate the strong points and weak points of both approaches, and to make a comparison. Finally, we prove that our approach to semantic construction is compatible with a wide range of grammatical formalisms, namely those which can be
expressed in terms of an abstract categorial grammar of order 2. One consequence of this characterisation is that Nessie can handle a large range of invertible grammars and hence is compatible with generation as well as analysis.
We conclude by discussing the adequacy of simply typed lambda calculus for natural language semantics.
Document type :
Complete list of metadatas

Cited literature [60 references]  Display  Hide  Download
Contributor : Sébastien Hinderer <>
Submitted on : Wednesday, January 14, 2009 - 3:44:12 PM
Last modification on : Saturday, May 19, 2018 - 1:26:42 AM
Long-term archiving on: : Thursday, October 11, 2012 - 3:58:08 PM


  • HAL Id : tel-01748422, version 2



Sébastien Hinderer. Automatisation de la Construction Sémantique dans le Lambda Calcul Simplement Typé avec plusieurs Types de base. Autre [cs.OH]. Université Henri Poincaré - Nancy 1, 2008. Français. ⟨tel-01748422v2⟩



Record views


Files downloads