Premium
Processing Scalar Implicature: A Constraint‐Based Approach
Author(s) -
Degen Judith,
Tanenhaus Michael K.
Publication year - 2015
Publication title -
cognitive science
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 1.498
H-Index - 114
eISSN - 1551-6709
pISSN - 0364-0213
DOI - 10.1111/cogs.12171
Subject(s) - naturalness , implicature , literal (mathematical logic) , mathematics , scalar (mathematics) , constraint (computer aided design) , set (abstract data type) , natural language processing , computer science , artificial intelligence , algorithm , linguistics , pragmatics , physics , geometry , particle physics , philosophy , programming language
Three experiments investigated the processing of the implicature associated with some using a “gumball paradigm.” On each trial, participants saw an image of a gumball machine with an upper chamber with 13 gumballs and an empty lower chamber. Gumballs then dropped to the lower chamber and participants evaluated statements, such as “You got some of the gumballs.” Experiment 1 established that some is less natural for reference to small sets (1, 2, and 3 of the 13 gumballs) and unpartitioned sets (all 13 gumballs) compared to intermediate sets (6–8). Partitive some of was less natural than simple some when used with the unpartitioned set. In Experiment 2, including exact number descriptions lowered naturalness ratings for some with small sets but not for intermediate size sets and the unpartitioned set. In Experiment 3, the naturalness ratings from Experiment 2 predicted response times. The results are interpreted as evidence for a Constraint‐Based account of scalar implicature processing and against both two‐stage, Literal‐First models and pragmatic Default models.