This article described three heuristics that are employed in making judgements under uncertainty: representativeness, which is usually employed when people are asked to judge the probability that an object or event A belongs to class or process B; availability of instances or scenarios, which is often employed when people are asked to assess the frequency of a class or the plausibility of a particular development; and adjustment from an anchor, which is usually employed in numerical prediction when a relevant value (...) is available. These heuristics are highly economical and usually effective, but they lead to systematic and predictable errors. A better understanding of these heuristics and of the biases to which they lead could improve judgements and decisions in situations of uncertainty. (shrink)

A recent development in the cognitive science of reasoning has been the emergence of a probabilistic approach to the behaviour observed on ostensibly logical tasks. According to this approach the errors and biases documented on these tasks occur because people import their everyday uncertain reasoning strategies into the laboratory. Consequently participants' apparently irrational behaviour is the result of comparing it with an inappropriate logical standard. In this article, we contrast the probabilistic approach with other approaches to explaining rationality, and then (...) show how it has been applied to three main areas of logical reasoning: conditional inference, Wason's selection task and syllogistic reasoning. (shrink)

The notion of common ground is important for the production of referring expressions: In order for a referring expression to be felicitous, it has to be based on shared information. But determining what information is shared and what information is privileged may require gathering information from multiple sources, and constantly coordinating and updating them, which might be computationally too intensive to affect the earliest moments of production. Previous work has found that speakers produce overinformative referring expressions, which include privileged names, (...) violating Grice’s Maxims, and concluded that this is because they do not mark the distinction between shared and privileged information. We demonstrate that speakers are in fact quite effective in marking this distinction in the form of their utterances. Nonetheless, under certain circumstances, speakers choose to overspecify privileged names. (shrink)

Utterances can convey more information than they explicitly encode, and speakers exploit communicative conventions in order to say more with less. However, the burden this places on perceivers is not well understood. This chapter examines the effect of speaker-specific information on pragmatic inferences using data from an experiment which investigated the time course of the use of pragmatic information in language comprehension. Previous evidence suggests that comprehenders who encounter a referential form, including a modifier that commonly indicates contrastiveness, assume that (...) the referential form is being used contrastively. Thus, they consequently look to the relevant object in the scene very early when processing the referential expression. In this case, people appear to be implicitly following H. P. Grice’s maxim of quantity. This chapter demonstrates that comprehenders stop using contrastive information early in resolving reference when speakers consistently do not use contrastive elements appropriately, consistent with a pragmatic explanation of referential contrast effects. (shrink)

This article offers a survey of computational research on referring expressions generation (REG). It introduces the REG problem and describes early work in this area, discussing what basic assumptions lie behind it, and showing how its remit has widened in recent years. We discuss computational frameworks underlying REG, and demonstrate a recent trend that seeks to link up REG algorithms with well-established Knowledge Representation traditions. Considerable attention is given to recent efforts at evaluating REG algorithms and the lessons that they (...) allow us to learn. The article concludes with a discussion of the way forward in REG, focussing on references in larger and more realistic settings. (shrink)