This paper discusses three potential varieties of update: updates to the common ground, structuring updates, and updates that introduce discourse referents. These different types of update are used to model different aspects of natural language phenomena. Not-at-issue information directly updates the common ground. The illocutionary mood of a sentence structures the context. Other updates introduce discourse referents of various types, including propositional discourse referents for at-issue information. Distinguishing these types of update allows a unified treatment of a broad range of (...) phenomena, including the grammatical evidentials found in Cheyenne (Algonquian) as well as English evidential parentheticals, appositives, and mood marking. An update semantics that can formalize all of these varieties of update is given, integrating the different kinds of semantic contributions into a single representation of meaning. (shrink)

Sentences containing pronouns and indefinite noun phrases can be said toexpress open propositions, propositions which display gaps to be filled.This paper addresses the question what is the linguistic content ofthese expressions, what information they can be said to provide to ahearer, and in what sense the information of a speaker can be said tosupport their utterance. We present and motivate first order notions ofcontent, update and support. The three notions are each defined in acompositional fashion and brought together within a (...) single and coherentframework. (shrink)

This paper provides a detailed comparison between discourse representation theory and dependent type semantics, two frameworks for discourse semantics. Although it is often stated that DRT and those frameworks based on dependent types are mutually exchangeable, we argue that they differ with respect to variable handling, more specifically, how substitution and other operations on variables are defined. This manifests itself in two recalcitrant problems posed for DRT; namely, the overwrite problem and the duplication problem. We will see that these problems (...) still pose a challenge for various extended compositional systems based on DRT, while they do not arise in a framework of DTS where substitution and other operations are defined in the standard type-theoretic manner without stipulating any additional constraints. We also compare the notions of contexts underlying these two kinds of frameworks, namely, contexts represented as assignment functions and contexts represented as proof terms, and see what different predictions they make for some linguistic examples. (shrink)

This article points out problems in current dynamic treatments of anaphora and provides a new account that solves these by grafting Muskens' Compositional Discourse Representation Theory onto a partial theory of types. Partiality is exploited to keep track of which discourse referents have been introduced in the text (thus avoiding the overwrite problem) and to account for cases of anaphoric failure. Another key assumption is that the set of discourse referents is well-ordered, so that we can keep track of the (...) order in which they have been introduced, allowing a semantic characterization of anaphoric accessibility across stretches of discourse. Unlike other dynamic approaches, the system defines semantic values for unresolved anaphors. This leads to a clear separation of monotonic and non-monotonic content (in this case anaphoric resolution) and arguably provides a sound basis for a non-monotonic theory of anaphoric resolution. (shrink)

This paper presents a new take on how argument dependencies in natural language are established and constrained. The paper starts with a rather standard view that (quantificational) argument dependencies are operator-variable dependencies. The interesting twist the paper offers is to eliminate the need for syntax that serves to enforce what the operator-variable dependencies are. Instead the role of ensuring grammatical and generally unambiguous forms is taken up by semantics imposing what are dependency requirements for any interpretation to go through at (...) evaluation time. With this viewpoint there emerges an essential need for localities as the hiding of (embedded) expression material, together with a (limited) form of garbage collection to release grammatical resources used in the current locality for reuse in subsequent localities. (shrink)

This paper explores the idea that scalar implicatures are computed with respect todiscourse referents. Given the general consensus that a proper account of pronominal anaphora in natural language requires discourse referents separately from the truth-conditional meaning, it is naturally expected that the anaphoric information that discourse referents carry play a role in the computation of scalar implicatures, but the literature has so far mostly exclusively focused on the truth-conditional dimension of meaning. This paper offers a formal theory of scalar implicatures (...) with discourse referents couched in dynamic semantics, and demonstrates its usefulness through a case study on the plurality inferences of plural nouns in English. (shrink)

It is well established by now that computer science has a number of concerns in common with natural language understanding. Common themes show up in particular with algorithmic aspects of text processing. This chapter gives an overview of border crossings from NLP to CS and back. Starting out from syntactic analysis, we trace our route via a philosophical puzzle about meaning, Hoare correctness rules for dynamic semantics, error state analysis of presupposition, equational reasoning about state change, programming with frameworks originally (...) devised for natural language semantics, and the logic of incremental processing. In many cases methods and perspectives developed on one side of the border proved quite useful on the other side, although usually it becomes clear after a while that tools have to be redesigned to fit. The chapter ends with a sketch of the emerging contours of a ‘proper treatment of context in natural language’ that is more than just an application of a logic designed for program analysis. (shrink)