We propose a constructionist approach to the polyfunctionality of the Italian focus particle magari (roughly corresponding to ‘maybe’, but also ‘I wish’). The sheer syntactic versatility of this word leads us to detect its formal regularities at the level of discourse configurations. This level of analysis, identified within the French linguistic tradition, is defined by the maintenance of a predicate-argument-adjunct structure in discourse. The salient feature of discourse configurations is their shape, which can be described by referring to a number (...) of topological patterns: lists of elements in the same syntactic position, repetition of syntactic structures, shifting of elements from a post-verbal to a pre-verbal position and so on. These topological patterns are meaningful to an extent and they are eligible to be regarded as constructions. Magari is shown to be regularly associated with a general topological pattern, namely a list of items that occupy the same syntactic position as the item focused by magari. Each semantic function of magari correlates with one particular kind of list. These associations of a form (the different types of lists) and a meaning (the functions of magari) are shown to be related to one another by means of inheritance links. (shrink)

The problems of access—retrieving linguistic structure from some mental grammar —and disambiguation—choosing among these structures to correctly parse ambiguous linguistic input—are fundamental to language understanding. The literature abounds with psychological results on lexical access, the access of idioms, syntactic rule access, parsing preferences, syntactic disambiguation, and the processing of garden‐path sentences. Unfortunately, it has been difficult to combine models which account for these results to build a general, uniform model of access and disambiguation at the lexical, idiomatic, and syntactic levels. (...) For example, psycholinguistic theories of lexical access and idiom access and parsing theories of syntactic rule access have almost no commonality in methodology or coverage of psycholinguistic data. This article presents a single probabilistic algorithm which models both the access and disambiguation of linguistic knowledge. The algorithm is based on a parallel parser which ranks constructions for access, and interpretations for disambiguation, by their conditional probability. Low‐ranked constructions and interpretations are pruned through beam‐search; this pruning accounts, among other things, for the garden‐path effect. I show that this motivated probabilistic treatment accounts for a wide variety of psycholinguistic results, arguing for a more uniform representation of linguistic knowledge and for the use of probabilistically‐enriched grammars and interpreters as models of human knowledge of and processing of language. (shrink)

We discuss a phenomenon that appears when ‘even’ occurs in questions. Specifically, an inference of what we call “extreme ignorance” is projected onto the speaker. We argue that this effect arises when the known unlikelihood ‘even’ focuses an entire question, resulting in the focused question being the least likely to be asked. Specific implicatures then conspire to bring about the inference that the speaker does not know the answer to the question that is most expected to be known. The environments (...) explored are Wh-questions and Y/N questions, and the languages looked at primarily English, Greek, German and Russian. (shrink)

This paper concentrates on giving precise content to the general wisdom on the scalar presupposition of even, according to which the prejacent of even, p, is stronger than its relevant focus alternatives, q. To that end I first examine both familiar challenges for the popular ‘comparative likelihood’ view of the ‘stronger than’ relation, as well as novel challenges, having to do with the context dependency of even and with its sensitivity to standards of comparison. To overcome these challenges and to (...) account for the full range of data I develop a revised, ‘gradability-based’ scalar presupposition for even, which differs from the ‘comparative likelihood’ one in several respects: instead of directly comparing degrees to which propositions are more or less likely, we compare extents to which non-focus entities x in p and q exceed the salient standard on a scale associated with a contextually supplied gradable property G. To capture cases where information about contrastive topics is crucial for fixing two distinct standards on G, I follow theories which view even as a general, two-place alternative-sensitive operator, allowing it to associate with both focus and contrastive topics. Beyond the ability to account for a large range of intricate felicity variations and inferences found with even, a more general contribution of the paper lies in showing the linguistic relevance of tools originally developed in the literature on gradable predicates to the semantics of scalar alternative–sensitive particles. (shrink)

This paper investigates whether 'even if A, B' is pragmatically polysemic, so that a nonconcessive conditional may have 'even if', and whether concessive conditionals, pragmatically defined, can fail to have 'even if' or a non-temporal 'still'. Different paraphrases are used to help elucidate pragmatic meanings. A theory of the pragmatic meanings of concessive and implicative conditionals is presented. The semantic meaning of 'even if' and the question of whether concessive conditionals imply the truth of their consequents are also discussed.

Like Bennett's account of ‘even’, my analysis incorporates the following plausible and widespread intuitions. (a) The word ‘even’ does not make a truth-functional difference; it makes a difference only in conventional implicature. In particular, ‘even’ functions neither as a universal quantifier, nor a most or many quantifier. The only quantified statement that ‘Even A is F’ implies is the existential claim ‘There is an x (namely, A) that is F’, but this implication is nothing more than what the Equivalence Thesis (...) already demands. (b) ‘Even’ is epistemic in character, implying some type of unexpectedness, surprise, or unlikelihood. Moreover, despite Kay's arguments to the contrary, this implication is part of the meaning of ‘even’. (c) ‘Even’ is a scalar term, since unexpectedness comes in degrees. And, finally, (d) the felicity of an ‘even’-sentence S requires that S* be sufficiently surprising in comparison to its true neighbors. However,pace Bennett, being more surprising than just one true neighbor will not suffice. At the same time, being more surprising than all true neighbors is unnecessary. Suffice it that S* is more surprising than most true neighbors. (shrink)

Nakanishi :115–136, 2012) presents a novel argument for the so-called scope theory of English sentential even, based on examples with antecedent-contained deletion. Nakanishi’s argument is based on the assumption that even cannot associate with a focus which has moved out of its LF scope. I show that this assumption is incorrect, defusing Nakanishi’s argument. I propose that when even associates with a focus which has moved out of its surface scope, it actually associates with focused material in the lower copies (...) of movement. I show that a closer look at ACD examples of Nakanishi’s type in fact yields a new argument against the scope theory. I conclude that English sentential even must always be interpreted in its pronounced position. The patterns of focus association with even presented here constitute a new argument for the copy theory of movement. (shrink)

The distribution of the focus particle even is constrained: if it is adjoined at surface structure to an expression that is entailed by its focus alternatives, as in even once, it must be appropriately embedded to be acceptable. This paper focuses on the context-dependent distribution of such occurrences of even in the scope of non-monotone quantifiers. We show that it is explained on the assumption that even can move at LF Syntax and semantics, 1979). The analysis is subsequently extended to (...) occurrences of negative polarity items in these environments, which mirror the abovementioned distribution of even and which invalidate standard characterizations of NPI licensing conditions in terms of downward-entailingness. The idea behind the extension is that NPIs denote weak elements that are associates of covert even. The paper concludes by discussing two comprehensive theories of NPI licensing and how our proposal relates to them. (shrink)

We review Potts' influential book on the semantics of conventional implicature , offering an explication of his technical apparatus and drawing out the proposal's implications, focusing on the class of CIs he calls supplements. While we applaud many facets of this work, we argue that careful considerations of the pragmatics of CIs will be required in order to yield an empirically and explanatorily adequate account.

This paper presents the first possible world semantics for concessive conditionals (i.e., even if A, C conditionals) constructed in a compositional way. First, the meaning of if is formalized through a semantics that builds on the proposal given by Stalnaker (1968). A major difference from Stalnaker’s approach is that irrelevant conditionals (i.e., conditionals where the antecedent and the consequent have no connection) are false in this new setting. Second, the meaning of even is analyzed through a formal semantics based on (...) the notion of scale. This analysis overcomes the problems arising in standard approaches, in which even is analyzed with the help of pragmatic presuppositions. Finally, the two particles are combined in order to provide a formal analysis of even if. This theory predicts the major phenomena concerning the behavior of concessive conditionals and without any call to pragmatic explanations. More generally, this approach creates the possibility of a compositional analysis of other conditionals such as if then or only if forms. (shrink)

This dissertation investigates the ways in which natural language restricts the domains of quantifiers. Adverbs of quantification are analyzed as quantifying over situations. The domain of quantifiers is pragmatically constrained: apparent processes of "semantic partition" are treated as pragmatic epiphenomena. The introductory Chapter 1 sketches some of the background of work on natural language quantification and begins the analysis of adverbial quantification over situations. Chapter 2 develops the central picture of "semantic partition" as a side-effect of pragmatic processes of anaphora (...) resolution. I argue that the apparent effects of topic/focus articulation and presuppositional information on the interpretation of quantifiers are not the result of a direct and local mechanism of sentence grammar. Instead, I develop an analysis where the link is established via the anaphoric dependence of quantifier domains on the discourse context. Chapter 3 discusses the analysis of conditional clauses as quantifier restrictors, concentrating on the question whether conditional clauses restrict quantifiers directly or indirectly. A treatment is explored which has if-clauses constrain the value of the hidden domain variable of the restricted quantifier. Chapter 4, on unless-clauses, and Chapter 5, on only if- and even if-clauses, present some issues in the compositional analysis of complex conditional clauses. These chapters significantly expand the data coverage of the theory of A-quantification. Building on previous work of mine on exceptives, I analyze unless-clauses as exceptive operators on A-quantifiers. The analysis of only if-clauses, treated as conditional clauses that combine if with the focus adverb only, unearthes some interesting new properties. Chapter 6, finally, examines the phenomenon of donkey-anaphora in the light of the results of the previous chapters. I show that a solution to the proportion problem may become possible once we combine the situation-semantic approach to adverbial quantification with the pragmatic theory developed in Chapter 2 and further elaborated in the analysis of donkey anaphora in complex conditionals. (shrink)