Generating Referring Expressions

Making Referents Easy to Identify

Ivandre Paraboni, Kees Van Deemter, Judith Masthoff

Research output: Contribution to journalArticle

44 Citations (Scopus)

Abstract

It is often desirable that referring expressions be chosen in such a way that their referents are easy to identify. This article focuses on referring expressions in hierarchically structured domains, exploring the hypothesis that referring expressions can be improved by including logically redundant information in them if this leads to a significant reduction in the amount of search that is needed to identify the referent. Generation algorithms are presented that implement this idea by including logically redundant information into the generated expression, in certain well-circumscribed situations. To test our hypotheses, and to assess the performance of our algorithms, two controlled experiments with human subjects were conducted. The first experiment confirms that human judges have a preference for logically redundant expressions in the cases where our model predicts this to be the case. The second experiment suggests that readers benefit from the kind of logical redundancy that our algorithms produce, as measured in terms of the effort needed to identify the referent of the expression.
Original languageEnglish
Pages (from-to)229-254
Number of pages26
JournalComputational Linguistics
Volume33
Issue number2
DOIs
Publication statusPublished - Jun 2007

Fingerprint

experiment
Experiments
redundancy
Redundancy
performance
Referring Expressions
Referent
Experiment
Hypothesis Test
Logic
Reader
Human Subjects
Controlled Experiment

Keywords

  • generation of referring expressions
  • overspecification
  • hearer-oriented evaluation

Cite this

Generating Referring Expressions : Making Referents Easy to Identify. / Paraboni, Ivandre; Van Deemter, Kees; Masthoff, Judith.

In: Computational Linguistics, Vol. 33, No. 2, 06.2007, p. 229-254.

Research output: Contribution to journalArticle

Paraboni, Ivandre ; Van Deemter, Kees ; Masthoff, Judith. / Generating Referring Expressions : Making Referents Easy to Identify. In: Computational Linguistics. 2007 ; Vol. 33, No. 2. pp. 229-254.
@article{1c38ddaa4b054408b395796fb05d51b9,
title = "Generating Referring Expressions: Making Referents Easy to Identify",
abstract = "It is often desirable that referring expressions be chosen in such a way that their referents are easy to identify. This article focuses on referring expressions in hierarchically structured domains, exploring the hypothesis that referring expressions can be improved by including logically redundant information in them if this leads to a significant reduction in the amount of search that is needed to identify the referent. Generation algorithms are presented that implement this idea by including logically redundant information into the generated expression, in certain well-circumscribed situations. To test our hypotheses, and to assess the performance of our algorithms, two controlled experiments with human subjects were conducted. The first experiment confirms that human judges have a preference for logically redundant expressions in the cases where our model predicts this to be the case. The second experiment suggests that readers benefit from the kind of logical redundancy that our algorithms produce, as measured in terms of the effort needed to identify the referent of the expression.",
keywords = "generation of referring expressions , overspecification , hearer-oriented evaluation",
author = "Ivandre Paraboni and {Van Deemter}, Kees and Judith Masthoff",
year = "2007",
month = "6",
doi = "10.1162/coli.2007.33.2.229",
language = "English",
volume = "33",
pages = "229--254",
journal = "Computational Linguistics",
issn = "0891-2017",
publisher = "MIT Press Journals",
number = "2",

}

TY - JOUR

T1 - Generating Referring Expressions

T2 - Making Referents Easy to Identify

AU - Paraboni, Ivandre

AU - Van Deemter, Kees

AU - Masthoff, Judith

PY - 2007/6

Y1 - 2007/6

N2 - It is often desirable that referring expressions be chosen in such a way that their referents are easy to identify. This article focuses on referring expressions in hierarchically structured domains, exploring the hypothesis that referring expressions can be improved by including logically redundant information in them if this leads to a significant reduction in the amount of search that is needed to identify the referent. Generation algorithms are presented that implement this idea by including logically redundant information into the generated expression, in certain well-circumscribed situations. To test our hypotheses, and to assess the performance of our algorithms, two controlled experiments with human subjects were conducted. The first experiment confirms that human judges have a preference for logically redundant expressions in the cases where our model predicts this to be the case. The second experiment suggests that readers benefit from the kind of logical redundancy that our algorithms produce, as measured in terms of the effort needed to identify the referent of the expression.

AB - It is often desirable that referring expressions be chosen in such a way that their referents are easy to identify. This article focuses on referring expressions in hierarchically structured domains, exploring the hypothesis that referring expressions can be improved by including logically redundant information in them if this leads to a significant reduction in the amount of search that is needed to identify the referent. Generation algorithms are presented that implement this idea by including logically redundant information into the generated expression, in certain well-circumscribed situations. To test our hypotheses, and to assess the performance of our algorithms, two controlled experiments with human subjects were conducted. The first experiment confirms that human judges have a preference for logically redundant expressions in the cases where our model predicts this to be the case. The second experiment suggests that readers benefit from the kind of logical redundancy that our algorithms produce, as measured in terms of the effort needed to identify the referent of the expression.

KW - generation of referring expressions

KW - overspecification

KW - hearer-oriented evaluation

U2 - 10.1162/coli.2007.33.2.229

DO - 10.1162/coli.2007.33.2.229

M3 - Article

VL - 33

SP - 229

EP - 254

JO - Computational Linguistics

JF - Computational Linguistics

SN - 0891-2017

IS - 2

ER -