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
REF discuss generating referring expressions in hierarchically structured domains, and explore the hypothesis that reducing search for the identifying referent with a referring expression can be improved by including logically redundant information, such as denoting the same content using different methods.
Generating Referring Expressions: Making Referents Easy to Identify
Computational Linguistics
Computer Science