The Gricean theory of conversational implicature has always been plagued by data suggesting that what would seem to be conversational inferences may occur within the scope of operators likebelieve, for example; which for bona fide implicatures should be an impossibility. Concentrating my attention on scalar implicatures, I argue that, for the most part, such observations can be accounted for within a Gricean framework, and without resorting to local pragmatic inferences of any kind. However, there remains a small class of marked (...) cases that cannot be treated as conversational implicatures, and they do require a local mode of pragmatic interpretation. (shrink)

The quantifier “some” often elicits a scalar implicature during comprehension: “Some of today's letters have checks inside” is often interpreted to mean that not all of today's letters have checks inside. In previous work, Goodman and Stuhlmüller (G&S) proposed a model that predicts that this implicature should depend on the speaker's knowledgeability: If the speaker has only examined some of the available letters (e.g., two of three letters), people are less likely to infer that “some” implies “not all” than if (...) the speaker has examined all of the available letters. G&S also provided behavioral evidence in support of their model. In this paper, we first show that a simple extension of G&S's model (1) predicts G&S's knowledgeability effects, and in addition, (2) predicts that the knowledgeability effect will be reduced when the speaker's usage indicates numeral alternatives are available. We tested the new model's predictions in four preregistered experiments. All experiments supported the first model prediction, replicating G&S's finding of a main effect of the speaker's knowledge. Further, Experiments 2 and 4 supported the second model prediction showing that the words that a speaker tends to use affect the strength of scalar implicature that comprehenders make. In particular, when the speaker has partial knowledge (e.g., has only examined two of three letters), comprehenders think that “some” is more likely to mean “not all” when the speaker also tends to produce number words in similar sentences (e.g., “2 of today's rooms have working smoke detectors.”). These results have important ramifications for theories of meaning: the context beyond the sentence (e.g., the speaker's tendency to use particular words) affects the set of alternatives that comprehenders consider when inferring meaning. (shrink)

We give derivations of two formal models of Gricean Quantity implicature and strong exhaustivity in bidirectional optimality theory and in a signalling games framework. We show that, under a unifying model based on signalling games, these interpretative strategies are game-theoretic equilibria when the speaker is known to be respectively minimally and maximally expert in the matter at hand. That is, in this framework the optimal strategy for communication depends on the degree of knowledge the speaker is known to have concerning (...) the question she is answering. In addition, and most importantly, we give a game-theoretic characterisation of the interpretation rule Grice (formalising Quantity implicature), showing that under natural conditions this interpretation rule occurs in the unique equilibrium play of the signalling game. (shrink)

We investigate the interactions between scalar implicatures and presuppositions in sentences containing both a scalar item and presupposition trigger. We first critically discuss Gajewski and Sharvit’s previous approach. We then closely examine two ways of integrating an exhaustivity-based theory of scalar implicatures with a trivalent approach to presuppositions. The empirical side of our discussion focuses on two novel observations: the interactions between prosody and monotonicity, and what we call presupposed ignorance. In order to account for these observations, our final proposal (...) relies on two mechanisms of scalar strengthening, the Presupposed Ignorance Principle and an exhaustivity operator which lets the presuppositions of negated alternatives project. (shrink)

Maximize Presupposition! is an economy condition that adjudicates between contextually equivalent competing structures. Building on data discovered by O. Percus, I will argue that the constraint is checked in the local contexts of embedded constituents. I will argue that this architecture leads to a general solution to the problem of antipresupposition projection, and also allows I. Heim’s ‘Novelty/Familiarity Condition’ to be eliminated as a constraint on operations of context change.

We present evidence that preschool children oftentimes understand disjunctive sentences as if they were conjunctive. The result holds for matrix disjunctions as well as disjunctions embedded under every. At the same time, there is evidence in the literature that children understand or as inclusive disjunction in downward-entailing contexts. We propose to explain this seemingly conflicting pattern of results by assuming that the child knows the inclusive disjunction semantics of or, and that the conjunctive inference is a scalar implicature. We make (...) two assumptions about implicature computation in the child: that children access only a proper subset of the adult alternatives, and that children possess the adult capacity to strengthen sentences with implicatures. As a consequence, children are expected to sometimes not compute any implicatures at all, but in other cases they are expected to compute an implicature that is different from the adult implicature. We argue that the child’s conjunctive strengthening of disjunctive sentences realizes the latter possibility: the adult infers that the conjunction is false but the child infers that the conjunction is true. This behaviour is predicted when our assumptions about child development are coupled with the assumption that a covert exhaustive operator is responsible for strengthening in both the child and the adult. Specifically, children’s conjunctive strengthening is predicted to follow from the same mechanism used by adults to compute conjunctive free choice implicatures in response to disjunctive permission sentences. We furthermore argue that this parallel between the child and the adult extends to disambiguation preferences. In particular, we present evidence that children prefer to strengthen disjunctions to conjunctions, in matrix and embedded positions ; this result mirrors previous findings that adults prefer to compute free choice, at the root and under every. We propose a disambiguation strategy that explains the preference for conjunctive strengthening – by both the child and the adult – even though there is no general preference for exhaustification. Specifically, we propose that the preference for a conjunctive strengthening follows from a pragmatic preference for a complete answer to the Question Under Discussion. (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)

The existence of “local implicatures” has been the topic of much recent debate. The purpose of this paper is to contribute to this debate by asking what we can learn from three puzzles, namely, the cancellation of such implicatures by or both, their behavior in the complement clauses of negative factive verbs such as sorry, and their behavior in root and embedded questions. Two basic approaches to local implicatures have been advanced: a fully pragmatic account in which local implicatures result (...) from conventional Gricean principles and a semantic account according to which the generation of implicatures is interwoven with compositional, grammatical mechanisms. We argue that the lesson to be learned from our three case studies is that some kind of approach along the latter, grammatical line is necessary to account for the data. (shrink)

Quite a few scholars claim that many implicata are propositions about the speaker's epistemic or doxastic states. I argue, on the contrary, that implicata are generally non-epistemic. Some alleged cases of epistemic implicature are not implicatures in the first place because they do not meet Grice's non-triviality requirement, and epistemic implicata in general would infringe on the maxim of quantity. Epistemic implicatures ought to be construed as members of a larger family of implicature-like phenomena.

Categorisation models of metaphor interpretation are based on the premiss that categorisation statements and comparison statements are fundamentally different types of assertion. Against this assumption, we argue that the difference is merely a quantitative one: ‘x is a y’ unilaterally entails ‘x is like a y’, and therefore the latter is merely weaker than the former. Moreover, if ‘x is like a y’ licenses the inference that x is not a y, then that inference is a scalar implicature. We defend (...) these claims partly on theoretical grounds and partly on the basis of experimental evidence. A suite of experiments indicates both that ‘x is a y’ unilaterally entails that x is like a y, and that in several respects the non-y inference behaves exactly as one should expect from a scalar implicature. We discuss the implications of our view of categorisation and comparison statements for categorisation models of metaphor interpretation. (shrink)

This paper argues that we need to re-think the semantics/pragmatics distinction in the light of new evidence from embedding of irony. This raises a new version of the old problem of ‘embedded implicatures’. I argue that embedded irony isn’t fully explained by solutions proposed for other embedded implicatures. I first consider two strategies: weak pragmatics and strong pragmatics. These explain embedded irony as truth-conditional content. However, by trying to shoehorn irony into said-content, they raise problems of their own. I conclude (...) by considering how a modified Gricean model can explain that irony embeds qua implicature. This leads us to prefer a local implicature model. This has important consequences for how we draw the semantics/pragmatics distinction. (shrink)

Language has a rich typology of inferential types. It was recently shown that subjects are able to divide the informational content of new visual stimuli among the various slots of the inferential typology: when gestures or visual animations are used in lieu of specific words in a sentence, they can trigger the very same inferential types as language alone (Tieu et al., 2019 ). How general are the relevant triggering algorithms? We show that they extend to the auditory modality and (...) to music cognition. We tested whether pro-speech musical gestures, i.e. musical excerpts that replace words in sentences, can give rise to the same inferences. We show that it is possible to replicate the same typology of inferences using pro-speech music. Minimal and complex musical excerpts can behave just like language, gestures, and visual animations with respect to the logical behavior of their content when embedded in sentences. Specifically, we found that pro-speech music can generate scalar implicatures, presuppositions, supplements, and homogeneity inferences. (shrink)

Structural priming is a powerful method to inform linguistic theories. We argue that this method extends nicely beyond syntax to theories of meaning. Priming, however, should still be seen as only one of the tools available for linguistic data collection. Specifically, because priming can occur at different, potentially conflicting levels, it cannot detect every aspect of linguistic representations.

The computation of both Scalar Implicatures (SI) and Association with Focus (AF) is characterized with reference to sets of alternatives. However, it has generally been assumed that the relevant alternatives are determined in different ways for the two processes. Specifically, it has been assumed that the alternatives for SI – scalar alternatives – are computed by a special procedure specifically designed for implicatures, whereas the alternatives for AF – focus alternatives – are determined by the general theory of association with (...) focus – focus semantics. As far as we know, the only attempt to connect the two is Krifka (1995), under which scalar alternatives and focus alternatives are identical and determined by focus semantics. However, Krifka’s result is based on a specific stipulation about scalar items, which he borrows from Horn and incorporates into focus semantics, namely that scalar items are inherently focused and have their Horn Scale as their lexically specified focus values. (shrink)

We revisit a typological puzzle due to Horn (Doctoral Dissertation, UCLA, 1972) regarding the lexicalization of logical operators: in instantiations of the traditional square of opposition across categories and languages, the O corner, corresponding to ‘nand’ (= not and), ‘nevery’ (= not every), etc., is never lexicalized. We discuss Horn’s proposal, which involves the interaction of two economy conditions, one that relies on scalar implicatures and one that relies on markedness. We observe that in order to express markedness and to (...) account for a bigger typological puzzle, namely the absence of lexicalizations of ‘XOR’ (= exclusive or), ‘all-or-none’, and many other imaginable logical operators, one must restrict the basic lexicalizable elements to a small set of primitives. We suggest that an ordering based perspective, following Keenan and Faltz (Boolean semantics for natural language, 1985), makes the stipulated primitives that we arrive at more natural. We also propose a modification to Horn’s proposal, based on recent work on implicatures, in which only the implicature condition is operative and in which markedness is part of the definition of the alternatives for scalar implicatures rather than an independent condition. (shrink)

The semantics of association with focus and the pragmatic conditions governing the appropriateness of focus in discourse are usually taken to depend on focus alternatives. According to a common view, these alternatives are generated by a permissive process. This permissive view has been challenged by Michael Wagner, who has noted that certain alternatives are systematically excluded from consideration. Wagner describes a more restrictive view, on which only contrastive alternatives are relevant for association with focus and for the appropriateness of focus (...) in discourse. I use recent work on the role of contradiction to show that the standard, permissive view derives the same results as the contrast-based view for the basic cases. These basic cases involve a contradiction that prevents us from using them to distinguish the two approaches. I show that when this contradiction is eliminated, evidence of non-contrastive alternatives emerges, supporting the permissive standard view over the restrictive contrast-based one. (shrink)

An exclusive disjunction is true when exactly one of the disjuncts is true. In the case of the familiar binary exclusive disjunction, we have a formula occurring as the first disjunct and a formula occurring as the second disjunct, so, if what we have is two formula-tokens of the same formula-type—one formula occurring twice over, that is—the question arises as to whether, when that formula is true, to count the case as one in which exactly one of the disjuncts is (...) true, counting by type, or as a case in which two disjuncts are true, counting by token. The latter is the standard answer: counting by tokens. James McCawley once suggested that, when the exclusively disjunctive construction in natural language is at issue, the construction should be treated as involving a multigrade connective whose semantic treatment is sensitive to the set of disjuncts rather than the corresponding multiset. Without any commitment as to whether there actually is such a construction, and conceding that for obvious pragmatic reasons such ‘repeated disjunct’ cases would be at best highly marginal, we note that for the binary case, this requires a nonstandard answer—count by type rather than by token—to the earlier question, and thus, an idempotent exclusive disjunction connective. Section 2 explores that idea and Section 3, a further idempotent variant for which it is the propositions expressed by the disjuncts, rather than the disjuncts themselves, that get counted once only in the case of repetitions. Sections 1 and 4 respectively set the stage for these investigations and conclude the discussion. More detailed considerations of points arising from the discussion but otherwise in danger of interrupting the flow are deferred to a ‘Longer Notes’ appendix at the end. (shrink)

The function of focus is to activate alternatives, and these activated alternatives are used to compute the corresponding inferences of an utterance. The experimental research reported here investigates the role of focus intonation in inference computation and its interplay with the overt focus particles only and also. In particular, I compare the mechanisms underlying the computation of exhaustivity implicatures, assertions, and additive presuppositions. A memory delay experiment revealed that contrastive intonation makes an exhaustive interpretation equally available as overt only. A (...) second experiment showed that in immediate processing, the implicature in bare focus conditions is delayed relative to the inferences associated with only and also. The findings thus indicate that L+H* accents do not conventionally encode an exhaustive meaning, but encourage implicature computation by making relevant alternatives salient and providing a strong cue that an inference should be derived. (shrink)

This paper investigates propositional hyperintensionality in counterfactuals. It starts with a scenario describing two children playing on a seesaw and studies the truth-value predictions for counterfactuals by four different semantic theories. The theories in question are Kit Fine’s truthmaker semantics, Luis Alonso-Ovalle’s alternative semantics, inquisitive semantics and Paolo Santorio’s syntactic truthmaker semantics. These predictions suggest that the theories that distinguish more of a given set of intensionally equivalent sentences (Fine and Alonso-Ovalle’s) fare better than those that do not (inquisitive semantics (...) and Santorio’s). Then we investigate how inquisitive semantics and Santorio can respond to these results. They can respond to them by helping themselves to considerations from Hurford disjunctions, disjunctions whose disjuncts stand in an entailment relation to one another. I argue that considerations from Hurford disjunctions are ad hoc modifications merely to predict the expected results. I conclude that the scenarios suggest a need for more fine-grained theories of sentential meaning in general. (shrink)

This paper proposes that both weak and strong NPIs in English are sensitive to the downward entailingness of their licensers. It is also proposed, however, that these two types of NPIs pay attention to different aspects of the meaning of their environment. As observed by von Fintel and Chierchia, weak NPIs do not attend to the scalar implicatures of presuppositions of their licensers. Strong NPIs see both the truth-conditional and non-truth-conditional (scalar implications, presuppositions) meaning of their licensers. This theory accounts (...) for the puzzling inability, noted by Rullmann and Gajewski, of Strawson anti-additive operators to license strong NPIs, as well as for the effects of Zwarts’s hierarchy of negative strength. Additional issues concerning comparative quantifiers, few, and proportional quantifiers are addressed. (shrink)

Building on previous works which argued that scalar implicatures can be computed in embedded positions, this paper proposes a constraint on exhaustification which restricts the conditions under which an exhaustivity operator can be licensed. We show that this economy condition allows us to derive a number of generalizations, such as, in particular, the ‘Implicature Focus Generalization’: scalar implicatures can be embedded under a downward-entailing operator only if the scalar term bears pitch accent. Our economy condition also derives specific predictions regarding (...) the licensing of so-called Hurford disjunctions. (shrink)

In recent work on the semantics of definite descriptions, some theorists :496–533, 2013) have advocated broadly Fregean accounts, whereby a definite description ‘the F’ introduces a presupposition to the effect that there is exactly one F and refers to it if there is, while other theorists Reference: Interdisciplinary perspectives, Oxford University Press, Oxford, pp. 61–72, 2008; Hawthorne and Manley in The reference book, Oxford University Press, Oxford, 2012) have advocated accounts whereby ‘the F’ introduces a presupposition to the effect that (...) there is exactly one F but otherwise has the semantics of ‘an F’, introducing existential quantification. It is argued that the latter theories, since they have definite descriptions encode assertoric content to the effect that there is an F, have difficulty accounting for the felicity of ‘The F is G’ when it is already presupposed that there is an F. (shrink)

The thesis that high probability suffices for rational belief, while initially plausible, is known to face the Lottery Paradox. The present paper proposes an amended version of that thesis which escapes the Lottery Paradox. The amendment is argued to be plausible on independent grounds.

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 and unpartitioned sets compared to intermediate sets. 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. (shrink)

The structural approach to alternatives :669–690, 2007; Fox and Katzir in Nat Lang Semant 19:87–107, 2011; Katzir in Semantics, pragmatics and the case of scalar implicatures, Palgrave Macmillan, London, pp 40–71, 2014) is the most developed attempt in the literature at solving the symmetry problem of scalar implicatures. Problematic data with indirect and particularised scalar implicatures have however been raised :249–270, 2015). To address these problems, Trinh and Haida proposed to augment the theory with the Atomicity Constraint. Here we show (...) that this constraint falls short of explaining minimal variants of the original problems, and moreover that it runs into trouble with the inferences of sentences involving gradable adjectives like full and empty. We furthermore discuss how the structural approach suffers at times from the problem of ‘too many lexical alternatives’ pointed out by Swanson :31–36, 2010), and at other times from the opposite problem of ‘too few lexical alternatives’. These three problems epitomise the challenge of constructing just enough alternatives under the structural approach to solve the symmetry problem in full generality. Finally, we also sketch another recent attempt at solving the symmetry problem, Bergen et al., 2016), which is based on relative informativity and complexity. We argue that Bergen et al. do not provide a general solution to the symmetry problem either, by pointing to some of the open problematic cases that remain for this approach as well. We conclude that while important progress has been made in the theory of alternatives for scalar implicatures in the last few years, a full solution to the symmetry problem has not yet been attained. (shrink)

The structural approach to alternatives :669–690, 2007; Fox and Katzir in Nat Lang Semant 19:87–107, 2011; Katzir in Semantics, pragmatics and the case of scalar implicatures, Palgrave Macmillan, London, pp 40–71, 2014) is the most developed attempt in the literature at solving the symmetry problem of scalar implicatures. Problematic data with indirect and particularised scalar implicatures have however been raised :249–270, 2015). To address these problems, Trinh and Haida proposed to augment the theory with the Atomicity Constraint. Here we show (...) that this constraint falls short of explaining minimal variants of the original problems, and moreover that it runs into trouble with the inferences of sentences involving gradable adjectives like full and empty. We furthermore discuss how the structural approach suffers at times from the problem of ‘too many lexical alternatives’ pointed out by Swanson :31–36, 2010), and at other times from the opposite problem of ‘too few lexical alternatives’. These three problems epitomise the challenge of constructing just enough alternatives under the structural approach to solve the symmetry problem in full generality. Finally, we also sketch another recent attempt at solving the symmetry problem, Bergen et al., 2016), which is based on relative informativity and complexity. We argue that Bergen et al. do not provide a general solution to the symmetry problem either, by pointing to some of the open problematic cases that remain for this approach as well. We conclude that while important progress has been made in the theory of alternatives for scalar implicatures in the last few years, a full solution to the symmetry problem has not yet been attained. (shrink)

To determine what the speaker in a cooperative dialog meant with his assertion, on top of what he explicitly said, it is crucial that we assume that the assertion he gave was optimal. In determining optimal assertions we assume that dialogs are embedded in decision problems (van Rooij 2003) and use backwards induction for calculating them (Benz 2006). In this paper, we show that in terms of our framework we can account for several types of implicatures in a uniform way, (...) suggesting that there is no need for an independent linguistic theory of generalized implicatures. In the final section, we show how we can embed our theory in the framework of signaling games, and how it relates with other game theoretic analyses of implicatures. (shrink)

To determine what the speaker in a cooperative dialog meant with his assertion, on top of what he explicitly said, it is crucial that we assume that the assertion he gave was optimal. In determining optimal assertions we assume that dialogs are embedded in decision problems (van Rooij 2003) and use backwards induction for calculating them (Benz 2006). In this paper, we show that in terms of our framework we can account for several types of implicatures in a uniform way, (...) suggesting that there is no need for an independent linguistic theory of generalized implicatures. In the final section, we show how we can embed our theory in the framework of signaling games, and how it relates with other game theoretic analyses of implicatures. (shrink)