Viewing Referring Expression Generation as Search

Almost all natural language generation (NLG) systems are faced with the problem of the generation of referring expressions (GRE): given a symbol corresponding to an intended referent, how do we work out the semantic content of a referring expression that uniquely identifies the entity in question? This is now one of the most widely explored problems in NLG: over the last 15 years, a number of algorithms have been proposed for addressing different aspects of this problem, but the different approaches taken make it very difficult to compare and contrast the algorithms provided in any meaningful way. In this paper, we show how viewing the problem of referring expression generation as a search problem allows us to recast existing algorithms in a way that makes their similarities and differences clear.

[1]  John A. Bateman,et al.  Using aggregation for selecting content when generating referring expressions , 1999, ACL.

[2]  Terry Winograd,et al.  Understanding natural language , 1974 .

[3]  Robert Dale,et al.  ‘One’-anaphora and the case for discourse-driven referring expression generation , 2003, ALTA.

[4]  Robert Dale,et al.  Cooking Up Referring Expressions , 1989, ACL.

[5]  Kees van Deemter.  Generating Referring Expressions: Boolean Extensions of the Incremental Algorithm , 2002, CL.

[6]  Robert Dale,et al.  A Fast Algorithm for the Generation of Referring Expressions , 1992, COLING.

[7]  Peter Norvig,et al.  Artificial Intelligence: A Modern Approach , 1995 .

[8]  Matthew Stone,et al.  On identifying sets , 2000, INLG.

[9]  Emiel Krahmer,et al.  Efficient context-sensitive generation of referring expressions , 2002 .

[10]  Helmut Horacek,et al.  An Algorithm for Generating Referential Descriptions with Flexible Interfaces , 1997, ACL.

[11]  Robert Dale,et al.  Generating Referring Expressions Involving Relations , 1991, EACL.

[12]  David D. McDonald.  Natural language production as a process of decision-making under constraints , 1980 .

[13]  Douglas Edmund Appelt,et al.  Planning natural language utterances to satisfy multiple goals , 1981 .

[14]  Emiel Krahmer,et al.  Graph-Based Generation of Referring Expressions , 2003, CL.

[15]  Allen Newell,et al.  GPS, a program that simulates human thought , 1995 .

[16]  Robert Dale,et al.  Computational Interpretations of the Gricean Maxims in the Generation of Referring Expressions , 1995, Cogn. Sci..