The aim of this article is to elucidate the processes that characterize natural language interpretation. The basic hypothesis is that natural language interpretation can be characterized as an optimization problem. This innovative view on interpretation is shown to account for the crucial role of contextual information while avoiding certain well-known problems associated with compositionality. This will become particularly clear in the context of incomplete expressions. Our approach takes as a point of departure total freedom of interpretation in combination with the (...) parallel application of soft constraints on possible interpretations. These constraints can be contextual, intonational or syntactic in nature. The integration of pragmatic and syntactic/semantic information in a system of ranked constraints is proposed to correctly derive the optimal interpretations in cases of nominal anaphorization, determiner quantification and elliptical comparatives. (shrink)

The term ‘ellipsis’ can be used to refer to a variety of phenomena: syntactic, semantic, and pragmatic. In this article, I discuss the recent comprehensive survey by Stainton 2006 of these kinds of ellipsis with respect to the analysis of nonsententials and try to show that despite his trenchant criticisms and insightful proposal, some of the criticisms can be evaded and the insights incorporated into a semantic ellipsis analysis, making a ‘divide-and-conquer’ strategy to the properties of nonsententials feasible after all. (...) -/- Editor's comment: To find the contribution, please go to item 16 of the URL, which contains the full text. Professor Merchant has permitted this. (shrink)

Rooth & Partee (1982) and Rooth (1985) have shown that the English-specific rule-by-rule system of PTQ can be factored out into function application plus two transformations for resolving type mismatch (type lifting and variable binding). Building on these insights, this article proposes a universal system for type-driven translation, by adding two more innovations: local type determination for gaps (generalizing Montague 1973) and a set of semantic filters (extending Cooper 1983). This system, dubbed Cross-Linguistic Semantics (XLS), is shown to account for (...) various phenomena — including scope relations in English and Greenlandic Eskimo, internally headed relative clauses in Lakhota, serial verbs in Yoruba and VP ellipsis in English. (shrink)

Cappelen and Lepore (2005) begin their critique of contextualism with an anecdote about an exercise they do with their undergraduate students (who I take it are meant to be naïve subjects whose linguistic intuitions have not been contaminated by mistaken philosophical theories). The test is to ask students to categorize types of expressions. Students quickly get the hang of the idea that referring expressions (like indexicals and pronouns) belong to a single category. They’re then asked whether they think that common (...) nouns like ‘penguin’ or adjectives like ‘red’ belong to this category, and of course students are reluctant to see any similarity here. Students are then told that, as incredible as it may seem, there are philosophers (called contextualists) who think that the indexical ‘I’ and the common noun ‘penguin’ belong to the same category and who think that these types of expressions are context-sensitive in just the same way. (shrink)

This paper argues that verb phrase ellipsis requires contrast. The central observation is that ellipsis is ungrammatical in tautologous conditionals; e.g., *_If John wins, then he does_. Ellipsis is correctly ruled out by a focus-based theory of ellipsis (Rooth 1992a, b ), but one that crucially imports focus’s requirement for contrast: an elliptical constituent must have an antecedent that is not merely an alternative to it, but a ‘proper’ alternative. An explanation in terms of contrast failure proves superior to alternative (...) explanations in terms of triviality and matching form. Showing as much catalogues what counts for contrast in ellipsis, encompassing negation, questions, and intensionality. Subjecting ellipsis to a contrast requirement is in direct conflict with the traditional analysis of MaxElide effects (Takahashi and Fox 2005 ), favouring alternative explanations (e.g., Jacobson 2019a, b ), perhaps in terms of contrast itself (Griffiths 2019 ). Overall, this paper establishes that contrast has explanatory power in ellipsis licensing. (shrink)

Matrix clauses are tensed in Korean and Japanese, but both languages have coordination constructions where any non-final conjunct may or, in the case of Japanese, must be untensed. Building on analyses of the temporal interpretation of tenseless languages such as Yucatec Maya and Kalaallisut, this article argues that a truly tenseless analysis of the temporal interpretation of these non-final conjuncts is possible once the effects of Aktionsart and the discourse context on temporal interpretation are taken into consideration. The formal semantic (...) analysis developed here is shown to be empirically and conceptually superior to previous analyses, which claim that the temporal interpretation of tenseless non-final conjuncts is determined either by the tense of the final conjunct or by a tense-like restriction introduced by a zero tense morpheme or the coordination marker. The proposed analysis of Korean and Japanese coordination constructions thus provides further evidence that tenseless clauses can be semantically interpreted as such, not just in tenseless languages but even in languages where matrix clauses are otherwise tensed. The article concludes by discussing implications for analyses of cross-linguistic semantic variation. (shrink)

Sentences such as “The ship was sunk to collect the insurance” exhibit an unusual form of anaphora, implicit control, where neither anaphor nor antecedent is audible. The non-finite reason clause has an understood subject, PRO, that is anaphoric; here it may be understood as naming the agent of the event of the host clause. Yet since the host is a short passive, this agent is realized by no audible dependent. The putative antecedent to PRO is therefore implicit, which it normally (...) cannot be. What sorts of representations subserve the comprehension of this dependency? Here we present four self-paced reading time studies directed at this question. Previous work showed no processing cost for implicit vs. explicit control, and took this to support the view that PRO is linked syntactically to a silent argument in the passive. We challenge this conclusion by reporting that we also find no processing cost for remote implicit control, as in: “The ship was sunk. The reason was to collect the insurance.” Here the dependency crosses two independent sentences, and so cannot, we argue, be mediated by syntax. Our Experiments 1–4 examined the processing of both implicit (short passive) and explicit (active or long passive) control in both local and remote configurations. Experiments 3 and 4 added either “3 days ago” or “just in order” to the local conditions, to control for the distance between the passive and infinitival verbs, and for the predictability of the reason clause, respectively. We replicate the finding that implicit control does not impose an additional processing cost. But critically we show that remote control does not impose a processing cost either. Reading times at the reason clause were never slower when control was remote. In fact they were always faster. Thus, efficient processing of local implicit control cannot show that implicit control is mediated by syntax; nor, in turn, that there is a silent but grammatically active argument in passives. (shrink)

Linguistics and philosophy have provided distinct views on the nature of reference to individuals in language. In philosophy, in particular in the tradition of direct reference, the distinction is between reference and description. In linguistics, in particular in the tradition of generative grammar, the distinction is between pronouns and R-expressions. I argue for a third conception, grounded in dynamic semantics, in which the main watershed is between definites, which trigger presuppositions that want to be bound, and indefinites, which set up (...) new discourse referents. On this view, proper names, indexicals, and definite descriptions are all analyzed as presupposition triggers. (shrink)

This thesis deals with the phenomenon of attitude reporting. More specifically, it provides a unified semantics of de re and de se belief reports. After arguing that de se belief is best thought of as a special case of de re belief, I examine whether we can extend this unification to the realm of belief reports. I show how, despite very promising first steps, previous attempts in this direction ultimately fail with respect to some relatively recent linguistic data involving quantified (...) and infinitival reports, logophoric constructions, and monstrously shifted indexicals. Formalizing my idea of a contextual resolution of acquaintance relations in a dynamic framework, I arrive at an alternative analysis that handles all these data. (shrink)

I provide a novel semantic analysis of proper names and indexicals, combining insights from the competing traditions of referentialism, championed by Kripke and Kaplan, and descriptivism, introduced by Frege and Russell, and more recently resurrected by Geurts and Elbourne, among others. From the referentialist tradition, I borrow the proof that names and indexicals are not synonymous to any definite description but pick their referent from the context directly. From the descriptivist tradition, I take the observation that names, and to some (...) extent indexicals, have uses that are best understood by analogy with anaphora and definite descriptions, that is, following Geurts, in terms of presupposition projection. The hybrid analysis that I propose is couched in Layered Discourse Representation Theory. Proper names and indexicals trigger presuppositions in a dedicated layer, which is semantically interpreted as providing a contextual anchor for the interpretation of the other layers. For the proper resolution of DRSs with layered presuppositions, I add two constraints to van der Sandt's algorithm. The resulting proposal accounts for both the classic philosophical examples and the new linguistic data, preserving a unified account of the preferred rigid interpretation of both names and indexicals, while leaving room for non-referential readings under contextual pressure. (shrink)

VP-ellipsis and pseudogapping in English show a previously unnoticed asymmetry in their tolerance for voice mismatch: while VP-ellipsis allows mismatches in voice between the elided VP and its antecedent, pseudogapping does not. This difference is unexpected under current analyses of pseudogapping, which posit that pseudogapping is a kind of VP-ellipsis. I show that this difference falls out naturally if the target of deletion in the two cases differs slightly: in VP-ellipsis, a node lower than [voi(ce)] is deleted, while in pseudogapping (...) a node containing [voi] is deleted. Moreover, this analysis accounts for a new observation concerning the distribution of floating quantifiers in these two constructions. (shrink)

Systematic semantic ambiguities result from the interaction of the two operations that are involved in resolving ellipsis in the presence of scoping elements such as quantifiers and intensional operators: scope determination for the scoping elements and resolution of the elided relation. A variety of problematic examples previously noted - by Sag, Hirschbüihler, Gawron and Peters, Harper, and others - all have to do with such interactions. In previous work, we showed how ellipsis resolution can be stated and solved in equational (...) terms. Furthermore, this equational analysis of ellipsis provides a uniform framework in which interactions between ellipsis resolution and scope determination can be captured. As a consequence, an account of the problematic examples follows directly from the equational method. The goal of this paper is merely to point out this pleasant aspect of the equational analysis, through its application to these cases. No new analytical methods or associated formalism are presented, with the exception of a straightforward extension of the equational method to intensional logic. (shrink)

Despite the attention that various forms of ellipsis have received inthe literature, the conditions under which a representation of anutterance may serve as a suitable referent for interpreting subsequentelliptical forms remain poorly understood. This fundamental questionremains as a point of contention, particularly because there are datato support various conflicting approaches that attempt to characterizethese conditions within a single module of language processing. Weshow a previously unnoticed pattern in VP-ellipsis data with respectto the type of coherence relation extant between the antecedentand (...) elided clauses. This pattern is explained by an account of howellipsis resolution processes interact with the inference processesunderlying the establishment of these relations. The analysis alsoexplains a similar yet distinct pattern in gapping constructions whichare not accounted for by purely syntactic approaches. Finally, wediscuss event reference and compare the resulting account to thedichotomy of types of anaphora posited by HanSag. (shrink)

The paper investigates an elliptical construction, Clarification Ellipsis, that occurs in dialogue. We suggest that this provides data that demonstrates that updates resulting from utterances cannot be defined in purely semantic terms, contrary to the prevailing assumptions of existing approaches to dynamic semantics. We offer a computationally oriented analysis of the resolution of ellipsis in certain cases of dialogue clarification. We show that this goes beyond standard techniques used in anaphora and ellipsis resolution and requires operations on highly structured, linguistically (...) heterogeneous representations. We characterize these operations and the representations on which they operate. We offer an analysis couched in a version of Head-Driven Phrase Structure Grammar combined with a theory of information states (IS) in dialogue. We sketch an algorithm for the process of utterance integration in IS which leads to grounding or clarification. The account proposed here has direct applications to the theory of attitude reports, an issue which is explored briefly in the concluding remarks of the paper. (shrink)

The HOU-based analysis of ellipsis was shown byDalrymple et al. (1991) and Shieber et al. (1996) to correctly capture thecomplex interaction of VP-ellipsis, scope and anaphora and claimed toextend to further related phenomena. When applied to deaccenting, theanalysis makes a strong prediction, namely that all anaphors occurringin the deaccented part of a deaccented utterance are parallelanaphors, i.e., anaphors that resolve to their parallel counterpart inthe source. I argue that this prediction is supported by the data andshow that it correctly captures (...) the interaction of deaccenting withanaphora, (in)definiteness and focus. (shrink)

We develop a vector space semantics for verb phrase ellipsis with anaphora using type-driven compositional distributional semantics based on the Lambek calculus with limited contraction of Jäger. Distributional semantics has a lot to say about the statistical collocation based meanings of content words, but provides little guidance on how to treat function words. Formal semantics on the other hand, has powerful mechanisms for dealing with relative pronouns, coordinators, and the like. Type-driven compositional distributional semantics brings these two models together. We (...) review previous compositional distributional models of relative pronouns, coordination and a restricted account of ellipsis in the DisCoCat framework of Coecke et al. :1079–1100, 2013). We show how DisCoCat cannot deal with general forms of ellipsis, which rely on copying of information, and develop a novel way of connecting typelogical grammar to distributional semantics by assigning vector interpretable lambda terms to derivations of LCC in the style of Muskens and Sadrzadeh Logical aspects of computational linguistics, Springer, Berlin, 2016). What follows is an account of ellipsis in which word meanings can be copied: the meaning of a sentence is now a program with non-linear access to individual word embeddings. We present the theoretical setting, work out examples, and demonstrate our results with a state of the art distributional model on an extended verb disambiguation dataset. (shrink)

ABSTRACT This paper introduces a multi-valued variant of higher-order resolution and proves it correct and complete with respect to a variant of Henkin's general model semantics. This resolution method is parametric in the number of truth values as well as in the particular choice of the set of connectives (given by arbitrary truth tables) and even substitutional quantifiers. In the course of the completeness proof we establish a model existence theorem for this logical system. The work reported in this paper (...) provides a basis for developing higher-order mechanizations for many non-classical logics. (shrink)

Explicatures are not cancellable. Theoretical considerations.

This paper concerns the question whether reflexives can have strict readings in VP-ellipsis. It is argued that the possibility for strict interpretation is determined by a syntactic factor: subordination of the elided clause relative to the antecedent clause facilitates strict interpretation, whereas coordination disfavors it. This contrast is shown to be predictable by theories of syntactic reconstruction which assume that a surface reflexive corresponds to a bound variable at the point of ellipsis reconstruction, and where the binder has scope over (...) a subordinated ellipsis but not over a coordinated ellipsis. One possibility is that the binder is the reflexive itself, moved at LF. A further factor, namely the possibility of speakers reinterpreting the ellipsis as a deep anaphor, accounts for why strict readings are in fact weakly acceptable in coordinated ellipsis. Previous accounts of ellipsis and reflexives are evaluated in light of the new data. (shrink)

This paper deals with the semantics of de dicto , de re and de se belief reports. First, I flesh out in some detail the established, classical theories that assume syntactic distinctions between all three types of reports. I then propose a new, unified analysis, based on two ideas discarded by the classical theory. These are: (i) modeling the de re/de dicto distinction as a difference in scope, and (ii) analyzing de se as merely a special case of relational de (...) re attitudes. The resurrection of these ideas takes place in a dynamic setting. My formalization of the first idea involves a modification of the presupposition-as-anaphora resolution algorithm for DRT. The second involves treating acquaintance relations as second-order presuppositions, to be bound in the context by means of higher-order unification, or accommodated if necessary. The resulting framework requires no syntactic distinctions between different modes of attitude, with the exception of a specific subclass of de se reports characterized by special ‘ de se pronouns’ (i.e. PRO and logophors). These special pronouns are handled in syntax; everything alse is passed on to the pragmatic resolution module as it appears on the surface. The more sophisticated contextual resolution process nonetheless ensures adequate output truth conditions for a variety of classical and novel puzzles. In particular, I compare the new pragmasemantic system to the classical, syntactic analysis with respect to iterated and quantified reports, and monstrously shifted indexicals. (shrink)

I show how a conversational process that takes simple, intuitively meaningful steps may be understood as a sophisticated computation that derives the richly detailed, complex representations implicit in our knowledge of language. To develop the account, I argue that natural language is structured in a way that lets us formalize grammatical knowledge precisely in terms of rich primitives of interpretation. Primitives of interpretation can be correctly viewed intentionally, as explanations of our choices of linguistic actions; the model therefore fits our (...) intuitions about meaning in conversation. Nevertheless, interpretations for complex utterances can be built from these primitives by simple operations of grammatical derivation. In bridging analyses of meaning at semantic and symbol‐processing levels, this account underscores the fundamental place for computation in the cognitive science of language use. (shrink)

Our first aim in this paper is to respond to four novel objections in Jason Stanley's 'Context and Logical Form'. Taken together, those objections attempt to debunk our prior claims that one can perform a genuine speech act by using a subsentential expression—where by 'subsentential expression' we mean an ordinary word or phrase, not embedded in any larger syntactic structure. Our second aim is to make it plausible that, pace Stanley, there really are pragmatic determinants of the literal truthconditional content (...) of speech acts. We hope to achieve this second aim precisely by defending the genuineness of subsentential speech acts. Given our two aims, it is necessary to highlight briefly their connection—which we do in the first part of the Introduction. Following that, we introduce Stanley's novel objections. This is the role of the second part of the Introduction. We offer our rebuttals in Section 2 (against 'shorthand') and Section 3 (against syntactic ellipsis, among other things). (shrink)

We argue that an adequate treatment of verb phrase anaphora must depart in two major respects from the standard approaches. First of all, VP anaphors cannot be resolved by simply identifying the anaphoric VP with an antecedent VP. The resolution process must establish a syntactic/semantic parallelism between larger units that the VPs occur in. Secondly, discourse structure has a significant influence on the reference possibilities of VPA. This influence must be accounted for. We propose a treatment which meets these requirements. (...) It builds on a discourse grammar which characterizes discourse cohesion by means of a syntactic/semantic matching procedure which recognizes parallel structures in discourse. It turns out that this independently motivated procedure yields the resolution of VPA as a side effect. (shrink)

Interdisciplinary investigations marry the methods and concerns of different fields. Computer science is the study of precise descriptions of finite processes; semantics is the study of meaning in language. Thus, computational semantics embraces any project that approaches the phenomenon of meaning by way of tasks that can be performed by following definite sets of mechanical instructions. So understood, computational semantics revels in applying semantics, by creating intelligent devices whose broader behavior fits the meanings of utterances, and not just their form. (...) IBM’s Watson (Ferrucci, Brown, Chu-Carroll, Fan, Gondek, Kalyanpur, Lally, Murdock, Nyberg, Prager, Schlaefer & Welty 2010) is a harbinger of the excitement and potential of this technology. (shrink)

We argue that an adequate treatment of verb phrase anaphora must depart in two major respects from the standard approaches. First of all, VP anaphors cannot be resolved by simply identifying the anaphoric VP with an antecedent VP. The resolution process must establish a syntactic/semantic parallelism between larger units that the VPs occur in. Secondly, discourse structure has a significant influence on the reference possibilities of VPA. This influence must be accounted for.We propose a treatment which meets these requirements. It (...) builds on a discourse grammar which characterizes discourse cohesion by means of a syntactic/semantic matching procedure which recognizes parallel structures in discourse. It turns out that this independently motivated procedure yields the resolution of VPA as a side effect. (shrink)

A sentence mentioning an object can be regarded as saying any one of several things about that object, without thereby being ambiguous. Some of the (logical) repercussions of this commonplace observation are recorded, and some critical discussion is provided of views which would appear to go against it.

VP ellipsis generally requires a syntactically matching antecedent. However, many documented examples exist where the antecedent is not appropriate. Kehler, 533–575. 2002, Coherence, Reference and the Theory of Grammer, CSLI Publications. Stanford.) proposed an elegant theory which predicts a syntactic antecedent for an elided VP is required only for a certain discourse coherence relation, not for cause-effect relations. Most of the data Kehler used to motivate his theory come from corpus studies and thus do not consist of true minimal pairs. (...) We report five experiments testing predictions of the coherence theory, using standard minimal pair materials. The results raise questions about the empirical basis for coherence theory because a syntactically-matching antecedent is preferred for all coherence relations, not just resemblance relations. Further, strict identity readings, which should not be available when a syntactic antecedent is required, are influenced by parallelism per se, holding the discourse coherence relation constant. This draws into question the causal role of coherence relations in processing VP ellipsis. (shrink)

Sloppy identity under ellipsis is generally attributed to the pronoun in ellipsis being a bound variable. However, sloppy identity can be licensed in structural configurations in which variable binding is ordinarily blocked. This paper provides a solution for this mismatch by reanalyzing the pronouns with the unexpected sloppy readings as E-type pronouns. Under the proposed analysis, the distribution of such pronouns is correctly predicted. It will also be shown that the analysis is successfully extended to sloppy identity in association-with-focus cases.

This paper presents the Constraint Language for Lambda Structures(CLLS), a first-order language for semantic underspecification thatconservatively extends dominance constraints. It is interpreted overlambda structures, tree-like structures that encode -terms. Based onCLLS, we present an underspecified, uniform analysis of scope,ellipsis, anaphora, and their interactions. CLLS solves a variablecapturing problem that is omnipresent in scope underspecification andcan be processed efficiently.

cal practice: the enterprise of specifying information about the world for use in computer systems. Knowledge representation as a field also encompasses conceptual results that call practitioners’ attention to important truths about the world, mathematical results that allow practitioners to make these truths precise, and computational results that put these truths to work. This chapter surveys this practice and its results, as it applies to the interpretation of natural language utterances in implemented natural language processing systems. For a broader perspective (...) on such technical practice, in all its strengths and weaknesses, see (Agre 1997). Knowledge representation offers a powerful general tool for the science of language. Computational logic, a prototypical formalism for representing knowledge about the world, is also the model for the level of logical form that linguists use to characterize the grammar of meaning (Larson and Segal 1995). And researchers from (Schank and Abelson 1977) to (Shieber 1993) and (Bos to appear) have relied crucially on such representations, and the inference methods associated with them, in articulating accounts of semantic relations in language, such as synonymy, entailment, informativeness and contradiction. The new textbooks (Blackburn and Bos 2002a, Blackburn and Bos 2002b) provide an excellent grounding in this research, and demonstrate how deeply computational ideas from knowledge representation can inform pure linguistic study. In this short chapter, I must leave much of.. (shrink)

Higher order unification is a way of combining information (or equivalently, solving equations) expressed as terms of a typed higher order logic. A suitably restricted form of the notion has been used as a simple and perspicuous basis for the resolution of the meaning of elliptical expressions and for the interpretation of some non-compositional types of comparative construction also involving ellipsis. This paper explores another area of application for this concept in the interpretation of sentences containing intonationally marked focus, or (...) various semantic constructs which are sensitive to focus.Similarities and differences between this approach, and theories using alternative semantics, structured meanings, or flexible categorial grammars, are described. The paper argues that the higher order unification approach offers descriptive advantages over these alternatives, as well as the practical advantage of being capable of fairly direct computational implementation. (shrink)

Four different kinds of grammars that can define crossing dependencies in human language are compared here: (i) context sensitive rewrite grammars with rules that depend on context, (ii) matching grammars with constraints that filter the generative structure of the language, (iii) copying grammars which can copy structures of unbounded size, and (iv) generating grammars in which crossing dependencies are generated from a finite lexical basis. Context sensitive rewrite grammars are syntactically, semantically and computationally unattractive. Generating grammars have a collection of (...) nice properties that ensure they define only “mildly context sensitive” languages, and Joshi has proposed that human languages have those properties too. But for certain distinctive kinds of crossing dependencies in human languages, copying or matching analyses predominate. Some results relevant to the viability of mildly context sensitive analyses and some open questions are reviewed. (shrink)

In this paper, we show that Higher{Order Coloured Uni cation { a form of uni cation developed for automated theorem proving { provides a general theory for modeling the interface between the interpretation process and other sources of linguistic, non semantic information. In particular, it provides the general theory for the Primary Occurrence Restriction which (Dalrymple et al., 1991)'s analysis called for.

This paper is concerned with constraints on the interpretation of pronominal anaphora, in particular Condition B effects. It aims to contribute to a particular approach, initiated by Reinhart (Anaphora and semantic interpretation, 1983) and further developed elsewhere. It proposes a modification of Reinhart’s Interface Rule, and argues that the resulting theory compares favorably with others, while being compatible with independently motivated general hypotheses about the interaction between different interpretive mechanisms.

This squib aims to show that the acceptability status of sluicing examples with an implicit antecedent in islands varies and discusses what is responsible for this variability. After investigating two representative structural approaches to sluicing that posit unpronounced structure in ellipsis sites, namely, Chung et al.’s Representing language: Essays in honor of Judith Aissen, 2010) LF-recovery analysis and Merchant’s PF-deletion analysis, we demonstrate that the acceptability data presented are challenging for both of them. Acceptable sluicing examples with implicit correlates in (...) islands cast doubt on Chung, Ladusaw, and McCloskey’s strict locality requirement, while unacceptable or degraded sluicing examples necessitate additional constraints for Merchant, who employs E-type anaphora as an escape hatch for island violations in sluicing. The gradient nature of the acceptability status of the examples under discussion calls for a non-structural factor that controls their acceptability. We speculate that it is discourse activation of implicit correlates that plays this crucial role. (shrink)

This paper analyzes sluicing as anaphora to an anti-constituent (a continuation), that is, to the semantic remnant of a clause from which a subconstituent has been removed. For instance, in Mary said that [John saw someone yesterday], but she didn’t say who, the antecedent clause is John saw someone yesterday, the subconstituent targeted for removal is someone, and the ellipsis site following who is anaphoric to the scope remnant John saw ___ yesterday. I provide a compositional syntax and semantics on (...) which the relationship between the targeted subconstituent and the rest of the antecedent clause is one of scopability, not movement or binding. This correctly predicts that sluicing should be sensitive to scope islands, but not to syntactic islands. Unlike the currently dominant approaches to sluicing, there is no need to posit syntactic structure internal to the ellipsis site, nor is there any need for a semantic mutual-entailment requirement. Nevertheless, the fragment handles phenomena usually taken to suggest a close syntactic correspondence between the antecedent and the sluice, including case matching, voice matching, and verbal argument structure matching. In addition, the analysis handles phenomena exhibiting antecedent/sluice mismatches, including examples such as John remembers meeting someone, but he doesn’t remember who, , and especially so-called sprouting examples such as John left, but I don’t know when, in which there is no overt subconstituent to target for removal. In Sect. 5, I show how the analysis accounts for Andrews Amalgams such as Sally ate [I don’t know what] today, in which the antecedent surrounds the sluiced clause. Finally, in Sect. 6, I propose a new semantic constraint on sluicing: the Answer Ban, which says that the antecedent clause must not resolve, or even partially resolve, the issue raised by the sluiced interrogative. (shrink)

We define an order independent version of default unification on typed feature structures. The operation is one where default information in a feature structure typed with a more specific type, will override default information in a feature structure typed with a more general type, where specificity is defined by the subtyping relation in the type hierarchy. The operation is also able to handle feature structures where reentrancies are default. We provide a formal semantics, prove order independence and demonstrate the utility (...) of this version of default unification in several linguistic applications. First, we show how it can be used to define multiple orthogonal default inheritance in the lexicon in a fully declarative fashion. Secondly, we show how default lexical specifications (introduced via default lexical inheritance) can be made to usefully persist beyond the lexicon and interact with syntagmatic rules. Finally, we outline how persistent default unification might underpin default feature propagation principles and a more restrictive and constraint-based approach to lexical rules. (shrink)

In this paper, we will argue that, of the various grammatical and discourse constraints that affect acceptability in Verb Phrase Ellipsis (VPE), only the structural parallelism constraint is unique to VPE. We outline (previously noted) systematic problems that arise for classical structural accounts of VPE resolution, and discuss efforts in recent research on VPE to reduce explanations of acceptability in VPE to general well-formedness constraints at the level of information structure [e.g. Kehler, 2000, 2002, Kertz, 2013, Kehler, 2015]. In two (...) magnitude estimation experiments, we show that — in line with Kehler’s predictions — degradation due to structural mismatch is modulated by coherence relation. On the other hand, we consistently find residual structural mismatch effects, suggesting that the interpretation of VPE is sensitive to structural features of the VPE antecedent. We propose that a structural constraint licenses VPE, but that sentences violating this constraint can nevertheless be interpreted. The variability in acceptability is accounted for not by additional constraints on VPE in the grammar, but by the numerous general biases that affect sentence and discourse well-formedness, such as information structural constraints [as proposed by Kertz, 2013], discourse coherence relations Kehler [2000], sensitivity to Question Under Discussion structure [e.g. Ginzburg and Sag, 2000, Kehler, 2015], and thematic role bias at the lexical level [e.g. McRae et al., 1998]. We test the prediction that thematic role bias (Experiment 3) and QUD structure (Experiment 4) will influence both elliptical and non-elliptical sentences alike, while structural mismatch continues to degrade elliptical sentences alone. Our proposal differs from existing proposals in cutting the explanatory pie in a different way with respect to how variations in acceptability are accounted for. We suggest that degradation can result from at least two distinct and separable sources: violating construction-specific grammatical constraints, or from complexity differences in interpretation related to very general discourse level information. (shrink)

Clarification requests, queries posed in response to a “problematic” (misheard, misunderstood, etc.) utterance, are a challenge to mainstream semantic theories because they call into question notions such as “shared content” or “the context.” Given their strong parallelism requirements, elliptical clarification requests introduce in addition significant complexities concerning the need for long-term maintenance of non-semantic information in context. In this paper, we consider a puzzle concerning the emergence of elliptical clarification requests in child English: Data from the Belfast and Manchester corpora (...) from CHILDES demonstrate that reprise fragments, the highest frequency clarification request construction among adults, emerges with significant delay in comparison with reprise sluices, bare wh-phrases used to request clarification. This is a puzzling finding a priori: first, since reprise fragments are by most plausible measures the most readily available clarification request form in that it involves mere repetition of material primed by the previous utterance and children have the ability to repeat parts of the previous utterance from the earliest stages of speech. Moreover, as we show, reprise fragments predominate—in some cases vastly so, over sluicing in the input of fragmentary clarification requests available to the child—and it would, therefore, be difficult to construct an explanation for order of emergence primarily based on frequency of the construction in the children's input. Our account is based on grammatical explication of the difference between the constructions, how constructional difference is represented in a hierarchy of constructions, and in terms of a notion of semantic complexity that suggests reprise sluicing is, in fact, less complex than reprise fragments. (shrink)

Percus & Sauerland (2003) use quantified belief reports of the form 'Only Peter thinks he's...' to argue for dedicated de se LFs. The argument is targeted against any reductionist account that sees de se as merely a particular subtype of de re, viz. a de re belief about oneself from a first person perspective, requiring nothing but an account of de re attitudes. My acquaintance resolution framework is an attempt at just such a reduction and in this paper I extend (...) that theory with a projection mechanism to allow local accommodation of acquaintance relations. With this extension we can account for their data, as well as for some related data involving quantified belief reports familiar from arguments in the de se literature. Note: the embedded video of Peter's mistaken self-identity is urlhttp://ncs.ruhosting.nl/emar/dese.mpgavailable in .mpg here. (shrink)

This paper presents a brief argument from the interaction of weak crossover (WCO), antecedent-contained deletion (ACD), and other facts of VP-ellipsis that subjects are base-generated in a predicateinternal position but move through an intermediate A-position on their way to their final landing site (the specifier of TP) and can take scope in this intermediate position.