A substantial amount of recent work in natural language generation has focused on the generation of ‘‘one‐shot’’ referring expressions whose only aim is to identify a target referent. Dale and Reiter's Incremental Algorithm (IA) is often thought to be the best algorithm for maximizing the similarity to referring expressions produced by people. We test this hypothesis by eliciting referring expressions from human subjects and computing the similarity between the expressions elicited and the ones generated by algorithms. It turns out that (...) the success of the IA depends substantially on the ‘‘preference order’’ (PO) employed by the IA, particularly in complex domains. While some POs cause the IA to produce referring expressions that are very similar to expressions produced by human subjects, others cause the IA to perform worse than its main competitors; moreover, it turns out to be difficult to predict the success of a PO on the basis of existing psycholinguistic findings or frequencies in corpora. We also examine the computational complexity of the algorithms in question and argue that there are no compelling reasons for preferring the IA over some of its main competitors on these grounds. We conclude that future research on the generation of referring expressions should explore alternatives to the IA, focusing on algorithms, inspired by the Greedy Algorithm, which do not work with a fixed PO. (shrink)

This paper asks why information should ever be expressed vaguely, re-assessing some previously proposed answers to this question and suggesting some new ones. Particular attention is paid to the benefits that vague expressions can have in situations where agreement over the meaning of an expression cannot be taken for granted. A distinction between two different versions of the above-mentioned question is advocated. The first asks why human languages contain vague expressions, the second question asks when and why a speaker should (...) choose a vague expression when communicating with a hearer. While the former question is purely theoretical, the latter has practical implications for the computational generation of utterances in Natural Language Generation (NLG). (shrink)

This article explores the role of surface ambiguities in referring expressions, and how the risk of such ambiguities should be taken into account by an algorithm that generates referring expressions, if these expressions are to be optimally effective for a hearer. We focus on the ambiguities that arise when adjectives occur in coordinated structures. The central idea is to use statistical information about lexical co‐occurrence to estimate which interpretation of a phrase is most likely for human readers, and to avoid (...) generating phrases where misunderstandings are likely. Various aspects of the problem were explored in three experiments in which responses by human participants provided evidence about which reading was most likely for certain phrases, which phrases were deemed most suitable for particular referents, and the speed at which various phrases were read. We found a preference for ‘‘clear’’ expressions to ‘‘unclear’’ ones, but if several of the expressions are ‘‘clear,’’ then brief expressions are preferred over non‐brief ones even though the brief ones are syntactically ambiguous and the non‐brief ones are not; the notion of clarity was made precise using Kilgarriff's Word Sketches. We outline an implemented algorithm that generates noun phrases conforming to our hypotheses. (shrink)

This response discusses the experiment reported in Krahmer et al.’s Letter to the Editor of Cognitive Science. We observe that their results do not tell us whether the Incremental Algorithm is better or worse than its competitors, and we speculate about implications for reference in complex domains, and for learning from ‘‘normal” (i.e., non-semantically-balanced) corpora.

A fundamental part of the process of referring to an entity is to categorise it (for instance, as the woman). Where multiple categorisations exist, this implicitly involves the adoption of a conceptual perspective. A challenge for the automatic Generation of Referring Expressions is to identify a set of referents coherently, adopting the same conceptual perspective. We describe and evaluate an algorithm to achieve this. The design of the algorithm is motivated by the results of psycholinguistic experiments.