InforLorV4, Hal, Corpus, bibRecord, 001165

Automating Semantic Construction in Simply Typed Lambda Calculus with Several Atomic Types

Identifieur interne : 001165 ( Hal/Corpus ); précédent : 001164; suivant : 001166

Automating Semantic Construction in Simply Typed Lambda Calculus with Several Atomic Types

Auteurs : Sébastien Hinderer

Source :

RBID : Hal:tel-00353065

Descripteurs français

mix :
- Construction Sémantique, Inférence, Lambda-Calcul, Types.

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.

Url:

https://tel.archives-ouvertes.fr/tel-00353065

Links to Exploration step

Hal:tel-00353065

Le document en format XML

<record><TEI><teiHeader><fileDesc><titleStmt><title xml:lang="en">Automating Semantic Construction in Simply Typed Lambda Calculus with Several Atomic Types</title>
<title xml:lang="fr">Automatisation de la Construction Sémantique dans le Lambda Calcul Simplement Typé avec plusieurs Types de base</title>
<author><name sortKey="Hinderer, Sebastien" sort="Hinderer, Sebastien" uniqKey="Hinderer S" first="Sébastien" last="Hinderer">Sébastien Hinderer</name>
<affiliation><hal:affiliation type="researchteam" xml:id="struct-35123" status="OLD"><idno type="RNSR">200718307Y</idno>
<orgName>Natural Language Processing: representation, inference and semantics</orgName>
<orgName type="acronym">TALARIS</orgName>
<desc><address><country key="FR"></country>
</address>
<ref type="url">http://www.inria.fr/equipes/talaris</ref>
</desc>
<listRelation><relation active="#struct-129671" type="direct"></relation>
<relation active="#struct-300009" type="indirect"></relation>
<relation active="#struct-206040" type="direct"></relation>
<relation active="#struct-413289" type="indirect"></relation>
<relation name="UMR7503" active="#struct-441569" type="indirect"></relation>
</listRelation>
<tutelles><tutelle active="#struct-129671" type="direct"><org type="laboratory" xml:id="struct-129671" status="VALID"><idno type="RNSR">198618246Y</idno>
<orgName>INRIA Nancy - Grand Est</orgName>
<desc><address><addrLine>615 rue du Jardin Botanique 54600 Villers-lès-Nancy</addrLine>
<country key="FR"></country>
</address>
<ref type="url">http://www.inria.fr/nancy</ref>
</desc>
<listRelation><relation active="#struct-300009" type="direct"></relation>
</listRelation>
</org>
</tutelle>
<tutelle active="#struct-300009" type="indirect"><org type="institution" xml:id="struct-300009" status="VALID"><orgName>Institut National de Recherche en Informatique et en Automatique</orgName>
<orgName type="acronym">Inria</orgName>
<desc><address><addrLine>Domaine de VoluceauRocquencourt - BP 10578153 Le Chesnay Cedex</addrLine>
<country key="FR"></country>
</address>
<ref type="url">http://www.inria.fr/en/</ref>
</desc>
</org>
</tutelle>
<tutelle active="#struct-206040" type="direct"><org type="laboratory" xml:id="struct-206040" status="VALID"><idno type="IdRef">067077927</idno>
<idno type="RNSR">198912571S</idno>
<idno type="IdUnivLorraine">[UL]RSI--</idno>
<orgName>Laboratoire Lorrain de Recherche en Informatique et ses Applications</orgName>
<orgName type="acronym">LORIA</orgName>
<date type="start">2012-01-01</date>
<desc><address><addrLine>Campus Scientifique BP 239 54506 Vandoeuvre-lès-Nancy Cedex</addrLine>
<country key="FR"></country>
</address>
<ref type="url">http://www.loria.fr</ref>
</desc>
<listRelation><relation active="#struct-300009" type="direct"></relation>
<relation active="#struct-413289" type="direct"></relation>
<relation name="UMR7503" active="#struct-441569" type="direct"></relation>
</listRelation>
</org>
</tutelle>
<tutelle active="#struct-413289" type="indirect"><org type="institution" xml:id="struct-413289" status="VALID"><idno type="IdRef">157040569</idno>
<idno type="IdUnivLorraine">[UL]100--</idno>
<orgName>Université de Lorraine</orgName>
<orgName type="acronym">UL</orgName>
<date type="start">2012-01-01</date>
<desc><address><addrLine>34 cours Léopold - CS 25233 - 54052 Nancy cedex</addrLine>
<country key="FR"></country>
</address>
<ref type="url">http://www.univ-lorraine.fr/</ref>
</desc>
</org>
</tutelle>
<tutelle name="UMR7503" active="#struct-441569" type="indirect"><org type="institution" xml:id="struct-441569" status="VALID"><idno type="ISNI">0000000122597504</idno>
<idno type="IdRef">02636817X</idno>
<orgName>Centre National de la Recherche Scientifique</orgName>
<orgName type="acronym">CNRS</orgName>
<date type="start">1939-10-19</date>
<desc><address><country key="FR"></country>
</address>
<ref type="url">http://www.cnrs.fr/</ref>
</desc>
</org>
</tutelle>
</tutelles>
</hal:affiliation>
</affiliation>
</author>
</titleStmt>
<publicationStmt><idno type="wicri:source">HAL</idno>
<idno type="RBID">Hal:tel-00353065</idno>
<idno type="halId">tel-00353065</idno>
<idno type="halUri">https://tel.archives-ouvertes.fr/tel-00353065</idno>
<idno type="url">https://tel.archives-ouvertes.fr/tel-00353065</idno>
<date when="2008-10-21">2008-10-21</date>
<idno type="wicri:Area/Hal/Corpus">001165</idno>
</publicationStmt>
<sourceDesc><biblStruct><analytic><title xml:lang="en">Automating Semantic Construction in Simply Typed Lambda Calculus with Several Atomic Types</title>
<title xml:lang="fr">Automatisation de la Construction Sémantique dans le Lambda Calcul Simplement Typé avec plusieurs Types de base</title>
<author><name sortKey="Hinderer, Sebastien" sort="Hinderer, Sebastien" uniqKey="Hinderer S" first="Sébastien" last="Hinderer">Sébastien Hinderer</name>
<affiliation><hal:affiliation type="researchteam" xml:id="struct-35123" status="OLD"><idno type="RNSR">200718307Y</idno>
<orgName>Natural Language Processing: representation, inference and semantics</orgName>
<orgName type="acronym">TALARIS</orgName>
<desc><address><country key="FR"></country>
</address>
<ref type="url">http://www.inria.fr/equipes/talaris</ref>
</desc>
<listRelation><relation active="#struct-129671" type="direct"></relation>
<relation active="#struct-300009" type="indirect"></relation>
<relation active="#struct-206040" type="direct"></relation>
<relation active="#struct-413289" type="indirect"></relation>
<relation name="UMR7503" active="#struct-441569" type="indirect"></relation>
</listRelation>
<tutelles><tutelle active="#struct-129671" type="direct"><org type="laboratory" xml:id="struct-129671" status="VALID"><idno type="RNSR">198618246Y</idno>
<orgName>INRIA Nancy - Grand Est</orgName>
<desc><address><addrLine>615 rue du Jardin Botanique 54600 Villers-lès-Nancy</addrLine>
<country key="FR"></country>
</address>
<ref type="url">http://www.inria.fr/nancy</ref>
</desc>
<listRelation><relation active="#struct-300009" type="direct"></relation>
</listRelation>
</org>
</tutelle>
<tutelle active="#struct-300009" type="indirect"><org type="institution" xml:id="struct-300009" status="VALID"><orgName>Institut National de Recherche en Informatique et en Automatique</orgName>
<orgName type="acronym">Inria</orgName>
<desc><address><addrLine>Domaine de VoluceauRocquencourt - BP 10578153 Le Chesnay Cedex</addrLine>
<country key="FR"></country>
</address>
<ref type="url">http://www.inria.fr/en/</ref>
</desc>
</org>
</tutelle>
<tutelle active="#struct-206040" type="direct"><org type="laboratory" xml:id="struct-206040" status="VALID"><idno type="IdRef">067077927</idno>
<idno type="RNSR">198912571S</idno>
<idno type="IdUnivLorraine">[UL]RSI--</idno>
<orgName>Laboratoire Lorrain de Recherche en Informatique et ses Applications</orgName>
<orgName type="acronym">LORIA</orgName>
<date type="start">2012-01-01</date>
<desc><address><addrLine>Campus Scientifique BP 239 54506 Vandoeuvre-lès-Nancy Cedex</addrLine>
<country key="FR"></country>
</address>
<ref type="url">http://www.loria.fr</ref>
</desc>
<listRelation><relation active="#struct-300009" type="direct"></relation>
<relation active="#struct-413289" type="direct"></relation>
<relation name="UMR7503" active="#struct-441569" type="direct"></relation>
</listRelation>
</org>
</tutelle>
<tutelle active="#struct-413289" type="indirect"><org type="institution" xml:id="struct-413289" status="VALID"><idno type="IdRef">157040569</idno>
<idno type="IdUnivLorraine">[UL]100--</idno>
<orgName>Université de Lorraine</orgName>
<orgName type="acronym">UL</orgName>
<date type="start">2012-01-01</date>
<desc><address><addrLine>34 cours Léopold - CS 25233 - 54052 Nancy cedex</addrLine>
<country key="FR"></country>
</address>
<ref type="url">http://www.univ-lorraine.fr/</ref>
</desc>
</org>
</tutelle>
<tutelle name="UMR7503" active="#struct-441569" type="indirect"><org type="institution" xml:id="struct-441569" status="VALID"><idno type="ISNI">0000000122597504</idno>
<idno type="IdRef">02636817X</idno>
<orgName>Centre National de la Recherche Scientifique</orgName>
<orgName type="acronym">CNRS</orgName>
<date type="start">1939-10-19</date>
<desc><address><country key="FR"></country>
</address>
<ref type="url">http://www.cnrs.fr/</ref>
</desc>
</org>
</tutelle>
</tutelles>
</hal:affiliation>
</affiliation>
</author>
</analytic>
</biblStruct>
</sourceDesc>
</fileDesc>
<profileDesc><textClass><keywords scheme="mix" xml:lang="es"><term>Lambda-Calculus</term>
<term>Semantic Construction</term>
</keywords>
<keywords scheme="mix" xml:lang="fr"><term>Construction Sémantique</term>
<term>Inférence</term>
<term>Lambda-Calcul</term>
<term>Types</term>
</keywords>
</textClass>
</profileDesc>
</teiHeader>
<front><div type="abstract" xml:lang="en">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.</div>
</front>
</TEI>
<hal api="V3"><titleStmt><title xml:lang="en">Automating Semantic Construction in Simply Typed Lambda Calculus with Several Atomic Types</title>
<title xml:lang="fr">Automatisation de la Construction Sémantique dans le Lambda Calcul Simplement Typé avec plusieurs Types de base</title>
<author role="aut"><persName><forename type="first">Sébastien</forename>
<surname>Hinderer</surname>
</persName>
<email>Sebastien.Hinderer@ens-lyon.org</email>
<idno type="halauthor">216208</idno>
<affiliation ref="#struct-35123"></affiliation>
</author>
<editor role="depositor"><persName><forename>Sébastien</forename>
<surname>Hinderer</surname>
</persName>
<email>Sebastien.Hinderer@ens-lyon.org</email>
</editor>
</titleStmt>
<editionStmt><edition n="v1" type="current"><date type="whenSubmitted">2009-01-14 15:44:12</date>
<date type="whenModified">2015-09-22 01:13:08</date>
<date type="whenReleased">2009-01-15 08:52:23</date>
<date type="whenProduced">2008-10-21</date>
<date type="whenEndEmbargoed">2009-01-14</date>
<ref type="file" target="https://tel.archives-ouvertes.fr/tel-00353065/document"><date notBefore="2009-01-14"></date>
</ref>
<ref type="file" n="1" target="https://tel.archives-ouvertes.fr/tel-00353065/file/these-hinderer.pdf"><date notBefore="2009-01-14"></date>
</ref>
</edition>
<respStmt><resp>contributor</resp>
<name key="117059"><persName><forename>Sébastien</forename>
<surname>Hinderer</surname>
</persName>
<email>Sebastien.Hinderer@ens-lyon.org</email>
</name>
</respStmt>
</editionStmt>
<publicationStmt><distributor>CCSD</distributor>
<idno type="halId">tel-00353065</idno>
<idno type="halUri">https://tel.archives-ouvertes.fr/tel-00353065</idno>
<idno type="halBibtex">hinderer:tel-00353065</idno>
<idno type="halRefHtml">Autre [cs.OH]. Université Henri Poincaré - Nancy I, 2008. Français</idno>
<idno type="halRef">Autre [cs.OH]. Université Henri Poincaré - Nancy I, 2008. Français</idno>
</publicationStmt>
<seriesStmt><idno type="stamp" n="CNRS">CNRS - Centre national de la recherche scientifique</idno>
<idno type="stamp" n="INRIA">INRIA - Institut National de Recherche en Informatique et en Automatique</idno>
<idno type="stamp" n="LORIA2">Publications du LORIA</idno>
<idno type="stamp" n="INRIA-NANCY-GRAND-EST">INRIA Nancy - Grand Est</idno>
<idno type="stamp" n="LORIA">LORIA - Laboratoire Lorrain de Recherche en Informatique et ses Applications</idno>
<idno type="stamp" n="LORIA-TALC" p="LORIA">Traitement automatique des langues et des connaissances</idno>
<idno type="stamp" n="UNIV-LORRAINE">Université de Lorraine</idno>
<idno type="stamp" n="INRIA-LORRAINE">INRIA Nancy - Grand Est</idno>
<idno type="stamp" n="INRIA_TEST">INRIA - Institut National de Recherche en Informatique et en Automatique</idno>
</seriesStmt>
<notesStmt></notesStmt>
<sourceDesc><biblStruct><analytic><title xml:lang="en">Automating Semantic Construction in Simply Typed Lambda Calculus with Several Atomic Types</title>
<title xml:lang="fr">Automatisation de la Construction Sémantique dans le Lambda Calcul Simplement Typé avec plusieurs Types de base</title>
<author role="aut"><persName><forename type="first">Sébastien</forename>
<surname>Hinderer</surname>
</persName>
<email>Sebastien.Hinderer@ens-lyon.org</email>
<idno type="halAuthorId">216208</idno>
<affiliation ref="#struct-35123"></affiliation>
</author>
</analytic>
<monogr><imprint><date type="dateDefended">2008-10-21</date>
</imprint>
<authority type="institution">Université Henri Poincaré - Nancy I</authority>
<authority type="supervisor">Patrick BLACKBURN(patrick.blackburn@loria.fr)</authority>
<authority type="jury">Nicholas ASHER (examinateur)</authority>
<authority type="jury">Patrick BLACKBURN (directeur de thèse)</authority>
<authority type="jury">Philippe DE GROOTE (examinateur)</authority>
<authority type="jury">Claude GODART (Président du Jury)</authority>
<authority type="jury">Jacques JAYEZ (rapporteur)</authority>
<authority type="jury">Reinhard MUSKENS (examinateur)</authority>
<authority type="jury">Christian RETORE (rapporteur)</authority>
</monogr>
<ref type="seeAlso">http://www.loria.fr/~hinderer/these.pdf</ref>
</biblStruct>
</sourceDesc>
<profileDesc><langUsage><language ident="fr">French</language>
</langUsage>
<textClass><keywords scheme="author"><term xml:lang="es">Semantic Construction</term>
<term xml:lang="es">Lambda-Calculus</term>
<term xml:lang="fr">Construction Sémantique</term>
<term xml:lang="fr">Lambda-Calcul</term>
<term xml:lang="fr">Types</term>
<term xml:lang="fr">Inférence</term>
</keywords>
<classCode scheme="halDomain" n="info.info-oh">Computer Science [cs]/Other [cs.OH]</classCode>
<classCode scheme="halTypology" n="THESE">Theses</classCode>
</textClass>
<abstract xml:lang="en">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.</abstract>
<abstract xml:lang="fr">Cette thèse étudie la construction automatique de représentations sémantiques comme lambda-termes simplement typés. Nous introduisons la sémantique formelle et computationnelle et présentons une tentative de construction sémantique à l'aide d'outils d'inférence. 
Nous expliquons les limites de cette approche et en proposons une autre, basée sur un outil appelé Nessie. Cet outil construit des représentations sémantiques grâce à un lexique spécifiant le sens des mots et à un arbre guidant la construction. L'implantation de l'outil est présentée et ses résultats sont comparés à ceux du système évoqué plus haut. Nous appliquons ensuite Nessie à deux tâches différentes.
D'abord, nous montrons comment il peut être utilisé (avec des outils d'inférence) pour étudier la sémantique du temps et de l'aspect des verbes polonais. Ensuite, nous présentons deux approches de la construction compositionnelle du sens de discours basées sur la théorie des types. Nous montrons que Nessie peut être utilisé pour calculer des représentations de discours dans ces deux formalismes; cette double implantation permet de souligner les points forts et les points faibles de chacune et de les comparer. Enfin, nous prouvons que notre approche de la construction sémantique est compatible avec une large gamme de formalismes syntaxiques: ceux reconnus par une grammaire catégorielle abstraite d'ordre 2. Une conséquence de cette caractérisation est que Nessie peut gérer une large gamme de grammaires inversibles et peut donc, théoriquement, être utilisé aussi bien en génération qu'en analyse. 
Nous concluons en discutant de la pertinence du lambda calcul simplement
typé pour la sémantique des langues naturelles.</abstract>
</profileDesc>
</hal>
</record>

Pour manipuler ce document sous Unix (Dilib)

EXPLOR_STEP=$WICRI_ROOT/Wicri/Lorraine/explor/InforLorV4/Data/Hal/Corpus

HfdSelect -h $EXPLOR_STEP/biblio.hfd -nk 001165 | SxmlIndent | more

HfdSelect -h $EXPLOR_AREA/Data/Hal/Corpus/biblio.hfd -nk 001165 | SxmlIndent | more

Pour mettre un lien sur cette page dans le réseau Wicri

{{Explor lien
   |wiki=    Wicri/Lorraine
   |area=    InforLorV4
   |flux=    Hal
   |étape=   Corpus
   |type=    RBID
   |clé=     Hal:tel-00353065
   |texte=   Automating Semantic Construction in Simply Typed Lambda Calculus with Several Atomic Types
}}

This area was generated with Dilib version V0.6.33.
Data generation: Mon Jun 10 21:56:28 2019. Site generation: Fri Feb 25 15:29:27 2022

	Serveur d'exploration sur la recherche en informatique en Lorraine
	Attention, ce site est en cours de développement ! Attention, site généré par des moyens informatiques à partir de corpus bruts. Les informations ne sont donc pas validées.

Serveur d'exploration sur la recherche en informatique en Lorraine

Automating Semantic Construction in Simply Typed Lambda Calculus with Several Atomic Types

Automating Semantic Construction in Simply Typed Lambda Calculus with Several Atomic Types

Source :

Descripteurs français

Abstract

Links to Exploration step

Le document en format XML

Pour manipuler ce document sous Unix (Dilib)

Pour mettre un lien sur cette page dans le réseau Wicri