Using set constraints to generate distinguishing descriptions
Identifieur interne : 003610 ( Crin/Curation ); précédent : 003609; suivant : 003611Using set constraints to generate distinguishing descriptions
Auteurs : Marilisa Amoia ; Claire Gardent ; Stefan ThaterSource :
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...)
- to stream Crin, to step Corpus: Pour aller vers cette notice dans l'étape Curation :003610
Links to Exploration step
CRIN:amoia02aLe document en format XML
<record><TEI><teiHeader><fileDesc><titleStmt><title xml:lang="en" wicri:score="274">Using set constraints to generate distinguishing descriptions</title></titleStmt><publicationStmt><idno type="RBID">CRIN:amoia02a</idno><date when="2002" year="2002">2002</date><idno type="wicri:Area/Crin/Corpus">003610</idno><idno type="wicri:Area/Crin/Curation">003610</idno><idno type="wicri:explorRef" wicri:stream="Crin" wicri:step="Curation">003610</idno></publicationStmt><sourceDesc><biblStruct><analytic><title xml:lang="en">Using set constraints to generate distinguishing descriptions</title><author><name sortKey="Amoia, Marilisa" sort="Amoia, Marilisa" uniqKey="Amoia M" first="Marilisa" last="Amoia">Marilisa Amoia</name></author><author><name sortKey="Gardent, Claire" sort="Gardent, Claire" uniqKey="Gardent C" first="Claire" last="Gardent">Claire Gardent</name></author><author><name sortKey="Thater, Stefan" sort="Thater, Stefan" uniqKey="Thater " first=" Stefan" last="Thater"> Stefan Thater</name></author></analytic></biblStruct></sourceDesc></fileDesc><profileDesc><textClass><keywords scheme="KwdEn" xml:lang="en"><term>constraints</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>amoia02a</ref><crinnumber>A02-R-459</crinnumber><category>3</category><equipe>Department of Computational Linguistics</equipe><author><e>Amoia, Marilisa</e><e>Gardent, Claire</e><e>Thater, Stefan</e></author><title>Using set constraints to generate distinguishing descriptions</title><booktitle>{7th International Workshop on Natural Language Understanding and Logic Programming - NLULP'02, Copenhagen, Denmark}</booktitle><year>2002</year><month>Jul</month><url>http://www.loria.fr/publications/2002/A02-R-459/A02-R-459.ps</url><keywords><e>constraints</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/Curation
HfdSelect -h $EXPLOR_STEP/biblio.hfd -nk 003610 | SxmlIndent | more
Ou
HfdSelect -h $EXPLOR_AREA/Data/Crin/Curation/biblio.hfd -nk 003610 | SxmlIndent | more
Pour mettre un lien sur cette page dans le réseau Wicri
{{Explor lien
|wiki= Wicri/Lorraine
|area= InforLorV4
|flux= Crin
|étape= Curation
|type= RBID
|clé= CRIN:amoia02a
|texte= Using set constraints to generate distinguishing descriptions
}}
| This area was generated with Dilib version V0.6.33. |  |