Generating Referring Expressions: Boolean Extensions of the Incremental Algorithm

Kees Van Deemter

Research output: Contribution to journalArticlepeer-review

81 Citations (Scopus)


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).
Original languageEnglish
Pages (from-to)37-52
Number of pages16
JournalComputational Linguistics
Issue number1
Publication statusPublished - 2002


  • Natural Language Generation


Dive into the research topics of 'Generating Referring Expressions: Boolean Extensions of the Incremental Algorithm'. Together they form a unique fingerprint.

Cite this