The clarity-brevity trade-off in generating referring expressions

Imtiaz Hussain Khan; Graeme D Ritchie; Kees Van Deemter

The clarity-brevity trade-off in generating referring expressions

Imtiaz Hussain Khan, Graeme D Ritchie, Kees Van Deemter

Computing Science

Research output: Chapter in Book/Report/Conference proceeding › Published conference contribution

Abstract

Existing algorithms for the Generation of Referring Expressions (GRE) aim at generating descriptions that allow a hearer to identify its intended referent uniquely; the length of the expression is also considered, usually as a secondary issue. We explore the possibility of making the trade-off between these two factors more explicit, via a general cost function which scores these two aspects separately. We sketch some more complex phenomena which might be amenable to this treatment.

Original language	English
Title of host publication	Proceedings of 4th International Conference on Natural Language Generation (INLG2006)
Publisher	ACL
Pages	89-91
Number of pages	3
Publication status	Published - 2006
Event	4th International Natural Language Generation Conference (INLG2006) - Sydney, Australia Duration: 15 Jul 2006 → 16 Jul 2006

Conference

Conference	4th International Natural Language Generation Conference (INLG2006)
Country/Territory	Australia
City	Sydney
Period	15/07/06 → 16/07/06

Keywords

Generation of Referring Expressions

Access to Document

http://www.aclweb.org/anthology/W/W06/W06-1413.pdf

Cite this

@inproceedings{d38d31d7c13e4daf88bd67ebc1bbf789,

title = "The clarity-brevity trade-off in generating referring expressions",

abstract = "Existing algorithms for the Generation of Referring Expressions (GRE) aim at generating descriptions that allow a hearer to identify its intended referent uniquely; the length of the expression is also considered, usually as a secondary issue. We explore the possibility of making the trade-off between these two factors more explicit, via a general cost function which scores these two aspects separately. We sketch some more complex phenomena which might be amenable to this treatment.",

keywords = "Generation of Referring Expressions",

author = "Khan, {Imtiaz Hussain} and Ritchie, {Graeme D} and {Van Deemter}, Kees",

year = "2006",

language = "English",

pages = "89--91",

booktitle = "Proceedings of 4th International Conference on Natural Language Generation (INLG2006)",

publisher = "ACL",

note = "4th International Natural Language Generation Conference (INLG2006) ; Conference date: 15-07-2006 Through 16-07-2006",

}

TY - GEN

T1 - The clarity-brevity trade-off in generating referring expressions

AU - Khan, Imtiaz Hussain

AU - Ritchie, Graeme D

AU - Van Deemter, Kees

PY - 2006

Y1 - 2006

N2 - Existing algorithms for the Generation of Referring Expressions (GRE) aim at generating descriptions that allow a hearer to identify its intended referent uniquely; the length of the expression is also considered, usually as a secondary issue. We explore the possibility of making the trade-off between these two factors more explicit, via a general cost function which scores these two aspects separately. We sketch some more complex phenomena which might be amenable to this treatment.

AB - Existing algorithms for the Generation of Referring Expressions (GRE) aim at generating descriptions that allow a hearer to identify its intended referent uniquely; the length of the expression is also considered, usually as a secondary issue. We explore the possibility of making the trade-off between these two factors more explicit, via a general cost function which scores these two aspects separately. We sketch some more complex phenomena which might be amenable to this treatment.

KW - Generation of Referring Expressions

M3 - Published conference contribution

SP - 89

EP - 91

BT - Proceedings of 4th International Conference on Natural Language Generation (INLG2006)

PB - ACL

T2 - 4th International Natural Language Generation Conference (INLG2006)

Y2 - 15 July 2006 through 16 July 2006

ER -

The clarity-brevity trade-off in generating referring expressions

Abstract

Conference

Keywords

Access to Document

Fingerprint

Cite this