Quarterly (March, June, September, December)
160 pp. per issue
6 3/4 x 10
ISSN
0891-2017
E-ISSN
1530-9312
2014 Impact factor:
1.23

Computational Linguistics

Paola Merlo, Editor
March 2002, Vol. 28, No. 1, Pages 37-52
(doi: 10.1162/089120102317341765)
© 2002 Association for Computational Linguistics
Generating Referring Expressions: Boolean Extensions of the Incremental Algorithm
Article PDF (194.42 KB)
Abstract

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).