We evaluate the richness of the child’s input in semantics and its relation to the hypothesis space available to the child. Our case study is the acquisition of the universal quantifier every. We report two main findings regarding the acquisition of every on the basis of a corpus study of child-directed and child-ambient speech. Our first finding is that the input in semantics is rich enough to systematically eliminate instances of the subset problem of language acquisition: overly general hypotheses about (...) the meaning of every can violate pragmatic constraints, making such hypotheses incompatible with the child’s input. Our second finding is that the semantic input is too poor to eliminate instances of what we refer to as the superset problem, the mirror image of the subset problem. We argue that at least some overly specific hypotheses about the meaning of every are compatible with the child’s input, suggesting either that those hypotheses are not made available by UG or that non-trivial inductive biases are involved in children’s acquisition of every. (shrink)

One of the most experimentally studied scales in the literature on scalar implicatures is the quantifier scale. While the truth of some is entailed by the truth of all, some is felicitous only when all is false. This opens the possibility that some would be felicitous if, e.g., 99% of the objects in the domain of quantification fall under it, a conclusion that clashes with native speakers’ intuitions. In Experiment 1 we report a questionnaire study on the perception of quantifier (...) meanings in English, French, Slovenian and German which points to a cross-linguistic variation with respect to the perception of numerical bounds of the existential quantifier. In Experiment 2, using a picture choice task, we further examine whether the numerical bound differences correlate with differences in pragmatic interpretations of the quantifier some in English and quelques in French and interpret the results as supporting our hypothesis that some and its cross-linguistic counterparts are subjected to different processes of pragmatic enrichment. (shrink)

The computation of scalar implicatures is sometimes costly relative to basic meanings. Among the costly computations are those that involve strengthening `some' to `not all' and strengthening inclusive disjunction to exclusive disjunction. The opposite is true for some other cases of strengthening, where the strengthened meaning is less costly than its corresponding basic meaning. These include conjunctive strengthenings of disjunctive sentences (e.g., free-choice inferences) and exactly-readings of numerals. Assuming that these are indeed all instances of strengthening via implicature/exhaustification, the puzzle (...) is to explain why strengthening sometimes increases costs while at other times it decreases costs. I develop a theory of processing costs that makes no reference to the strengthening mechanism or to other aspects of the derivation of the sentence's form/meaning. Instead, costs are determined by domain-general considerations of the grammar's output, and in particular by aspects of the meanings of ambiguous sentences and particular ways they update the context. Specifically, I propose that when the hearer has to disambiguate between a sentence's basic and strengthened meaning, the processing cost of any particular choice is a function of (i) a measure of the semantic complexity of the chosen meaning and (ii) a measure of how much relevant uncertainty it leaves behind in the context. I measure semantic complexity with Boolean Complexity in the propositional case and with semantic automata in the quantificational case, both of which give a domain-general measure of the minimal representational complexity needed to express the given meaning. I measure relevant uncertainty with the information-theoretic notion of entropy; this domain-general measure formalizes how `far' the meaning is from giving a complete answer to the question under discussion, and hence gives an indication of how much representational complexity is yet to come. Processing costs thus follow from domain-general considerations of current and anticipated representational complexity. The results might also speak to functional motivations for having strengthening mechanisms in the first place. Specifically, exhaustification allows language users to use simpler forms than would be available without it to both resolve relevant uncertainties and convey complex meanings. (shrink)