Embedded Scalars and Typicality

Abstract

In recent years, the interpretation of scalar terms in embedded environments has been investigated extensively. Some experimentalists have been concerned with sentences like (1), in which a scalar term is embedded under a universal quantifier. The controversy involves the question whether ‘some’ in these sentences is interpreted as ‘some but not all’, thus leading to the embedded upper-bounded inference that no square is connected to all of the circles. (1) All the squares are connected with some of the circles. Geurts & Pouscoulous (2009) conducted a verification task that seemed to prove that the inference is not licensed. In response, Clifton & Dube (2010) and Chemla & Spector (2011) gathered evidence suggesting the opposite conclusion. By experimentally investigating the typicality structure of complex quantified sentences like (1) above, I show how the results of the latter two experiments can be explained as typicality effects. Typicality plays a significant role in the comprehension of quantified sentences, thus complicating the interpretation of data from the kinds of experiments that have been employed to test between theories of upper-bounded inferences.

Cite this work

No public copy is stored for this record, so only the metadata is cited.

Stored only when both papers are in the corpus — 50 citations exist upstream.

Papers that cite the same references — the relational fallback while embeddings are still backfilling.