文章基本信息

标题：Generating Referring Expressions: Boolean Extensions of the Incremental Algorithm
本地全文：下载
作者：Kees van Deemter
期刊名称：Computational Linguistics
印刷版ISSN：0891-2017
电子版ISSN：1530-9312
出版年度：2002
卷号：28
期号：1
页码：37-52
DOI：10.1162/089120102317341765
语种：English
出版社：MIT Press
摘要：This paper brings a logical perspective to the generation of referring expressions, addressing the incompleteness of existing algorithms in this area. After studying references to individual objects, we discuss references to sets, including Boolean descriptions that make use of negated and disjoined properties. To guarantee that a distinguishing description is generated whenever such descriptions exist, the paper proposes generalizations and extensions of the Incremental Algorithm of Dale and Reiter (1995).