Generating minimal definite descriptions
Identifieur interne : 001221 ( Crin/Checkpoint ); précédent : 001220; suivant : 001222Generating minimal definite descriptions
Auteurs : Claire GardentSource :
English descriptors
Abstract
The incremental algorithm introduced in \DalRei95 for producing distinguishing descriptions does not always generate a minimal description. In this paper, I show that when generalised to sets of individuals and disjunctive properties, this approach might generate unnecessarily long and ambiguous and/or epistemically redundant descriptions. I then present an alternative, constraint-based algorithm and show that it builds on existing related algorithms in that (i) it produces minimal descriptions for sets of individuals using positive, negative and disjunctive properties, (ii) it straightforwardly generalises to n-ary relations and (iii) it is integrated with surface realisation.
Links toward previous steps (curation, corpus...)
Links to Exploration step
CRIN:gardent02bLe document en format XML
<record><TEI><teiHeader><fileDesc><titleStmt><title xml:lang="en" wicri:score="244">Generating minimal definite descriptions</title></titleStmt><publicationStmt><idno type="RBID">CRIN:gardent02b</idno><date when="2002" year="2002">2002</date><idno type="wicri:Area/Crin/Corpus">003618</idno><idno type="wicri:Area/Crin/Curation">003618</idno><idno type="wicri:explorRef" wicri:stream="Crin" wicri:step="Curation">003618</idno><idno type="wicri:Area/Crin/Checkpoint">001221</idno><idno type="wicri:explorRef" wicri:stream="Crin" wicri:step="Checkpoint">001221</idno></publicationStmt><sourceDesc><biblStruct><analytic><title xml:lang="en">Generating minimal definite descriptions</title><author><name sortKey="Gardent, Claire" sort="Gardent, Claire" uniqKey="Gardent C" first="Claire" last="Gardent">Claire Gardent</name></author></analytic></biblStruct></sourceDesc></fileDesc><profileDesc><textClass><keywords scheme="KwdEn" xml:lang="en"><term>constraintes</term><term>referential expressions</term><term>text generation</term></keywords></textClass></profileDesc></teiHeader><front><div type="abstract" xml:lang="en" wicri:score="2488">The incremental algorithm introduced in \DalRei95 for producing distinguishing descriptions does not always generate a minimal description. In this paper, I show that when generalised to sets of individuals and disjunctive properties, this approach might generate unnecessarily long and ambiguous and/or epistemically redundant descriptions. I then present an alternative, constraint-based algorithm and show that it builds on existing related algorithms in that (i) it produces minimal descriptions for sets of individuals using positive, negative and disjunctive properties, (ii) it straightforwardly generalises to n-ary relations and (iii) it is integrated with surface realisation.</div></front></TEI><BibTex type="inproceedings"><ref>gardent02b</ref><crinnumber>A02-R-460</crinnumber><category>3</category><equipe>LANGUE ET DIALOGUE</equipe><author><e>Gardent, Claire</e></author><title>Generating minimal definite descriptions</title><booktitle>{40th Annual Meeting of the Association for Computational Linguistic - ACL'02, Philadelphia, USA}</booktitle><year>2002</year><month>Jul</month><url>http://www.loria.fr/publications/2002/A02-R-460/A02-R-460.ps</url><keywords><e>constraintes</e><e>text generation</e><e>referential expressions</e></keywords><abstract>The incremental algorithm introduced in \DalRei95 for producing distinguishing descriptions does not always generate a minimal description. In this paper, I show that when generalised to sets of individuals and disjunctive properties, this approach might generate unnecessarily long and ambiguous and/or epistemically redundant descriptions. I then present an alternative, constraint-based algorithm and show that it builds on existing related algorithms in that (i) it produces minimal descriptions for sets of individuals using positive, negative and disjunctive properties, (ii) it straightforwardly generalises to n-ary relations and (iii) it is integrated with surface realisation.</abstract></BibTex></record>Pour manipuler ce document sous Unix (Dilib)
EXPLOR_STEP=$WICRI_ROOT/Wicri/Lorraine/explor/InforLorV4/Data/Crin/Checkpoint
HfdSelect -h $EXPLOR_STEP/biblio.hfd -nk 001221 | SxmlIndent | more
Ou
HfdSelect -h $EXPLOR_AREA/Data/Crin/Checkpoint/biblio.hfd -nk 001221 | SxmlIndent | more
Pour mettre un lien sur cette page dans le réseau Wicri
{{Explor lien
|wiki= Wicri/Lorraine
|area= InforLorV4
|flux= Crin
|étape= Checkpoint
|type= RBID
|clé= CRIN:gardent02b
|texte= Generating minimal definite descriptions
}}
| This area was generated with Dilib version V0.6.33. |  |