Generating Referring Expressions: Boolean Extensions of the Incremental Algorithm

Kees Van Deemter

Research output: Contribution to journalArticle

66 Citations (Scopus)

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

Fingerprint

guarantee
Referring Expressions
Logic
Incompleteness

Keywords

  • Natural Language Generation

Cite this

Generating Referring Expressions : Boolean Extensions of the Incremental Algorithm. / Van Deemter, Kees.

In: Computational Linguistics, Vol. 28, No. 1, 2002, p. 37-52.

Research output: Contribution to journalArticle

@article{5e98d82d3fb0452392b1dc3171d7e67e,
title = "Generating Referring Expressions: Boolean Extensions of the Incremental Algorithm",
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).",
keywords = "Natural Language Generation",
author = "{Van Deemter}, Kees",
year = "2002",
language = "English",
volume = "28",
pages = "37--52",
journal = "Computational Linguistics",
issn = "0891-2017",
publisher = "MIT Press Journals",
number = "1",

}

TY - JOUR

T1 - Generating Referring Expressions

T2 - Boolean Extensions of the Incremental Algorithm

AU - Van Deemter, Kees

PY - 2002

Y1 - 2002

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

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

KW - Natural Language Generation

M3 - Article

VL - 28

SP - 37

EP - 52

JO - Computational Linguistics

JF - Computational Linguistics

SN - 0891-2017

IS - 1

ER -