Distinguishing speed from accuracy in scalar implicatures

In this study we investigated this cost using a sentence verification task similar to that of Bott and Noveck (2004) combined with a response deadline procedure to estimate speed and accuracy independently. Experiment 1 compared implicit upper-bound interpretations (some [but not all]) with lower-bound interpretations (some [and possibly all]). Experiment 2 compared an implicit upper-bound meaning of some with the explicit upper-bound meaning of only some. Experiment 3 compared an implicit lower-bound meaning of some with the explicit lower-bound meaning of at least some. Sentences with implicatures required additional processing time that could not be attributed to retrieval probabilities or factors relating to semantic complexity. Our results provide evidence against several different types of processing models, including verification and nonverification default implicature models and cost-free contextual models. More generally, our data are the first to provide evidence of the costs associated with deriving implicatures per se. Highlights ► We investigated why scalar implicatures are costly to process. ► We compared accuracy as a function of time to sentences with and without implicatures. ► Delayed implicatures are not due to retrieval probabilities or semantic complexity. ► Implicatures are costly to derive and interpret.
Source: Journal of Memory and Language - Category: Speech Therapy Source Type: research