We examine the problem of generating definite noun phrases that are appropriate referring expressions; that is, noun phrases that (a) successfully identify the intended referent to the hearer whilst (b) not conveying to him or her any false conversational implicatures (Grice, 1975). We review several possible computational interpretations of the conversational implicature maxims, with different computational costs, and argue that the simplest may be the best, because it seems to be closest to what human speakers do. We describe our recommended (...) algorithm in detail, along with a specification of the resources a host system must provide in order to make use of the algorithm, and an implementation used in the natural language generation component of the IDAS system. (shrink)

Two experiments examined the restriction of referential domains during unscripted conversation by analyzing the modification and online interpretation of referring expressions. Experiment 1 demonstrated that from the earliest moments of processing, addressees interpreted referring expressions with respect to referential domains constrained by the conversation. Analysis of eye movements during the conversation showed elimination of standard competition effects seen with scripted language. Results from Experiment 2 pinpointed two pragmatic factors responsible for restriction of the referential domains used by speakers to design (...) referential expressions and demonstrated that the same factors predict whether addressees consider local competitors to be potential referents during online interpretation of the same expressions. These experiments demonstrate, for the first time, that online interpretation of referring expressions in conversation is facilitated by referential domains constrained by pragmatic factors that predict when addressees are likely to encounter temporary ambiguity in language processing. (shrink)

(1995). References. Critical Review: Vol. 9, RATIONAL CHOICE THEORY AND POLITICS, pp. 277-300.