Semantics and Generative Grammar. Pronouns and Variable Assignments 1. We ve seen that implicatures are crucially related to context.

Similar documents
Introduction to Semantics. Pronouns and Variable Assignments. We ve seen that implicatures are crucially related to context.

The Semantics of Definite DPs 1. b. Argument Position: (i) [ A politician ] arrived from Washington. (ii) Joe likes [ the politician ].

Semantics and Generative Grammar. Quantificational DPs, Part 2: Quantificational DPs in Non-Subject Position and Pronominal Binding 1

Introduction to Semantics. The Formalization of Meaning 1

Semantics and Generative Grammar. The Semantics of Adjectival Modification 1. (1) Our Current Assumptions Regarding Adjectives and Common Ns

Semantics and Generative Grammar. Expanding Our Formalism, Part 1 1

Introduction to Semantics. Common Nouns and Adjectives in Predicate Position 1

A Review of the Essentials of Extensional Semantics 1

Spring 2018 Ling 620 The Basics of Intensional Semantics, Part 1: The Motivation for Intensions and How to Formalize Them 1

Semantics and Generative Grammar. An Introduction to Intensional Semantics 1

Semantics and Generative Grammar. Quantificational DPs, Part 3: Covert Movement vs. Type Shifting 1

Spring 2018 Ling 620 Introduction to Semantics of Questions: Questions as Sets of Propositions (Hamblin 1973, Karttunen 1977)

Spring 2017 Ling 620. An Introduction to the Semantics of Tense 1

Proseminar on Semantic Theory Fall 2013 Ling 720 The Proper Treatment of Quantification in Ordinary English, Part 1: The Fragment of English

564 Lecture 25 Nov. 23, Continuing note on presuppositional vs. nonpresuppositional dets.

Moreno Mitrović. The Saarland Lectures on Formal Semantics

Top Down and Bottom Up Composition. 1 Notes on Notation and Terminology. 2 Top-down and Bottom-Up Composition. Two senses of functional application

Spring 2017 Ling 620 The Semantics of Control Infinitives: A First Introduction to De Se Attitudes

Proseminar on Semantic Theory Fall 2010 Ling 720 The Basics of Plurals: Part 1 1 The Meaning of Plural NPs and the Nature of Predication Over Plurals

Semantics 2 Part 1: Relative Clauses and Variables

a. Develop a fragment of English that contains quantificational NPs. b. Develop a translation base from that fragment to Politics+λ

Semantics and Generative Grammar. A Little Bit on Adverbs and Events

Proseminar on Semantic Theory Fall 2010 Ling 720. Remko Scha (1981/1984): Distributive, Collective and Cumulative Quantification

Quantification in the predicate calculus

Spring 2017 Ling 620. The Semantics of Modals, Part 3: The Ordering Source 1

Spring 2017 Ling 620. The Semantics of Modals, Part 2: The Modal Base 1

Proseminar on Semantic Theory Fall 2010 Ling 720. The Basics of Plurals: Part 2 Distributivity and Indefinite Plurals

Proseminar on Semantic Theory Fall 2015 Ling 720 Adnominal Tenses Redux: Thomas (2014) Nominal Tense and Temporal Implicatures

Spring 2017 Ling 620 Conditionals as Modal Modifiers Conditional Constructions: Some Basic Terminology, Questions, and Assumptions

Spring 2017 Ling 620 Eliminating Res-Movement : An Introduction to Concept Generators

Semantics and Pragmatics of NLP The Semantics of Discourse: Overview

Scalar Implicatures: Are There Any?

Ling 98a: The Meaning of Negation (Week 5)

Presuppositions (introductory comments)

Spring 2018 Ling 620 The Semantics of Modals, Part 1: Basics of the Quantificational Analysis, and the Appearance of Ambiguity 1

Parasitic Scope (Barker 2007) Semantics Seminar 11/10/08

Grundlagenmodul Semantik All Exercises

1 Classical scalar implicature

(7) a. [ PP to John], Mary gave the book t [PP]. b. [ VP fix the car], I wonder whether she will t [VP].

E-type interpretation without E-type pronoun: How Peirce s Graphs. capture the uniqueness implication of donkey sentences

Semantics and Generative Grammar. Formal Foundations: A Basic Review of Sets and Functions 1

Ling 130 Notes: Syntax and Semantics of Propositional Logic

Proseminar on Semantic Theory Fall 2013 Ling 720 Problem Set on the Analysis of Quantification: Answers and Notes

Binding Theory Different types of NPs, constraints on their distribution

Ling 130 Notes: Predicate Logic and Natural Deduction

Spring 2012 Ling 753 A Review of Some Key Ideas in the Semantics of Plurals. 1. Introduction: The Interpretations of Sentences Containing Plurals

Singleton Indefinites (re. Schwarzschild 2000)

Presupposition and Montague Grammar (Krahmer 1998, Ch. 5)

LIN1032 Formal Foundations for Linguistics

Basics of conversational implicatures

Approaching the Logic of Conversational Implicatures

Gender in conditionals

Two Reconstruction Puzzles Yael Sharvit University of Connecticut

Semantics and Pragmatics of NLP Pronouns

A proof theoretical account of polarity items and monotonic inference.

Must... stay... strong!

Introduction to Pragmatics

Against generalized quantifiers (and what to replace them with)

Logic. Quantifiers. (real numbers understood). x [x is rotten in Denmark]. x<x+x 2 +1

1 The standard quantifiers in FOL

1. Background. Task: Determine whether a given string of words is a grammatical (well-formed) sentence of language L i or not.

Lecture 13: Soundness, Completeness and Compactness

Hedging Your Ifs and Vice Versa

CAS LX 522 Syntax I Fall 2000 October 10, 2000 Week 5: Case Theory and θ Theory. θ-theory continued

Hamblin Semantics & Focus

Logica e Linguaggio. Raffaella Bernardi. March 22, University of Trento

Some binding facts. Binding in HPSG. The three basic principles. Binding theory of Chomsky

Introduction to Metalogic

Parsing with Context-Free Grammars

X-bar theory. X-bar :

Predicates, Quantifiers and Nested Quantifiers

How to determine if a statement is true or false. Fuzzy logic deal with statements that are somewhat vague, such as: this paint is grey.

First Order Logic: Syntax and Semantics

DEGREE QUANTIFIERS, POSITION OF MERGER EFFECTS WITH THEIR RESTRICTORS, AND CONSERVATIVITY

Semantics Boot Camp. Contents. Elizabeth Coppock. Compilation of handouts from NASSLLI 2012, Austin Texas (revised December 15, 2012) 1 Semantics 2

Ch. 2: Phrase Structure Syntactic Structure (basic concepts) A tree diagram marks constituents hierarchically

Proseminar on Semantic Theory Fall 2013 Ling 720 Propositional Logic: Syntax and Natural Deduction 1

Two sets of alternatives for numerals

Andrew Carnie, Structural Relations. The mathematical properties of phrase structure trees

Models of Adjunction in Minimalist Grammars

AI Programming CS S-09 Knowledge Representation

7.2. Generalizations and quantifiers Overview

RN, Chapter 8 Predicate Calculus 1

Consequence Relations and Natural Deduction

Hardegree, Formal Semantics, Handout of 8

G52DOA - Derivation of Algorithms Predicate Logic

INTRODUCTION TO LOGIC. Propositional Logic. Examples of syntactic claims

Introduction to Logic and Axiomatic Set Theory

Logical Structures in Natural Language: First order Logic (FoL)

Denotation of Predicates

1 Rules in a Feature Grammar

KB Agents and Propositional Logic

HPSG: Binding Theory

Written by Rachel Singh, last updated Oct 1, Functions

CHAPTER THREE: RELATIONS AND FUNCTIONS

Knowledge representation DATA INFORMATION KNOWLEDGE WISDOM. Figure Relation ship between data, information knowledge and wisdom.

CS460/626 : Natural Language Processing/Speech, NLP and the Web

Kratzer on Modality in Natural Language

INTRODUCTION TO LOGIC 4 The Syntax of Predicate Logic

Logic. Propositional Logic: Syntax

Transcription:

Pronouns and Variable Assignments 1 1. Putting this Unit in Context (1) What We ve Done So Far This Unit Expanded our semantic theory so that it includes (the beginnings of) a theory of how the presuppositions of a sentence are derived. Expanded our theory so that it includes (the beginnings of) a theory of how the implicatures of a sentence are derived. (2) Implicatures and Context We ve seen that implicatures are crucially related to context. Implicatures are inferences drawn from (i) the asserted content of the sentence, and (ii) features of the context, particularly the assumption that the speaker is following the Gricean Conversational Maxims Thus, context clearly has an effect on the informational content of a sentence, through its affect on the implicatures of the sentence. (3) Truth-Conditions and Context But, it turns out, implicatures aren t the only thing affected by context In this part of the unit, we will see that context also affects the truth-conditions (asserted content) of a sentence a. Key Example: Pronouns (i) (ii) In a context where I am pointing at Barack Obama, He smokes is T iff Barack Obama smokes. In a context where I am pointing at Joe Biden, He smokes is T iff Joe Biden smokes. b. Conclusion: The T-conditions of He smokes varies from context to context. c. Our Goal for This Unit: Augment our extensional semantics so that it captures the way in which the T-conditions of certain sentences (e.g. those containing pronouns) depend upon features of the context. 1 These notes are based on the material in Heim & Kratzer (1998: 86-115, 239-245). 1

2. Pronouns and the Basic Problem of Their Context Dependency (4) Overarching Question How should / could our semantic system model the meanings of pronouns? What should our interpretation function [[. ]] yield as the extension of a pronoun? Our Methodology (Again): Let s consider the T-conditions of sentences that contain pronouns and lexical items whose extensions we already know, and from those try to deduce a lexical entry for the pronoun that will derive those T-conditions (5) First Core Fact The extension of a pronoun seems to be an entity. In a context where the speaker is pointing at Barack: [[ He smokes ]] = T iff Barack smokes. CONCLUSION: [[He]] = Barack (in this context) (6) Second Core Fact The extension of a pronoun can vary across contexts. In a context where the speaker is pointing at Joe: [[ He doesn t drink ]] = T iff Joe doesn t drink. CONCLUSION: [[He]] = Joe (in this context) (7) The Challenge The property in (6) poses a serious problem for our account (as it is currently structured). How do we write a lexical entry for [[ he ]] which reflects the fact that its value varies depending on the context? We can t just write [[he]] = Barack or Joe or Barney or John for every x in D e Not only does such an entry just look ugly, it doesn t do the crucial work of relating the extension of the pronoun to the specific context it s used in all such an entry says is that he can refer to those entities it doesn t tell us when it can refer to those entities. 2

(8) A Syntactic Side-Note Following decades of work in syntactic theory, we will assume that pronouns are DPs. Thus, their structure is as follows: DP D he. 3. Variable Assignments: The Basic Idea (9) The Challenge (Restated) How can we augment our semantic interpretation function [[. ]] so that it somehow represents properties of the context? (10) The Solution (First Pass) We will represent contextual information via special superscripts on [[. ]] We will start with that contextual information which concerns the interpretation of pronouns. We will represent that information with a special superscript, which we will call the variable assignment. For now, we take variable assignments to be single specific entities taken from D e (11) Some Lingo [[ XP ]] g = the extension of XP relative to the variable assignment g ( the extension of XP in a context where we re talking about g ) (12) Pronoun Rule, First Pass [PR] If X is a pronoun (he, she, it, him, her, his, etc.), then [[X]] g = g Illustration a. [[ he ]] Barack = Barack b. [[ he ]] Joe = Joe 3

The introduction of variable assignments to our interpretation function [[. ]] requires that we make a few minor adjustments to our semantic interpretation rules (13) General Convention for Non-Pronominals If X is not a pronoun, then [[X]] g = [[X]] Illustration [[ smokes ]] Obama = [[ smokes ]] = [ λx e : x smokes ] (14) General Convention for Semantic Rules Our existing rules of semantic composition are not yet sensitive to variable assignments. a. (New) Function Application Let g be any variable assignment. If X is a branching node that has two daughters Y and Z and if [[Y]] g is a function whose domain contains [[Z]] g, then [[X]] g = [[Y]] g ( [[Z]] g ) b. (New) Non-Terminal Nodes Let g by any variable assignment. If X is a non-branching node, and Y is its sole daughter, then [[X]] g = [[Y]] g c. (New) Terminal Nodes Let g be any variable assignment. If X is a terminal node and is not a pronoun, then [[X]] g (= [[X]]) is specified in the lexicon d. (New) Predicate Modification Let g be any variable assignment. If X is a branching node that has two daughters Y and Z and if both [[Y]] g and [[Z]] g are in D <et>, then [[X]] g = [ λx : x D e. [[Y]] g (x) = T and [[Z]] g (x) = T ] These notational additions allow our system to: (i) calculate T-conditions for sentences containing pronouns (relative to a given context) (ii) capture the fact that the T-conditions of such sentences can vary with the context. 4

(15) Sample Derivation 1 Context: We are talking about Barack a. S is T iff (by notation) DP D He VP V smokes b. [[ S ]] Barack = T c. Subproof (i) [[ VP ]] Barack = (by NNx2, TN) (ii) [ λx e : x smokes ] d. Subproof (i) [[ DP ]] Barack = (by NNx 2) (ii) [[ he ]] Barack = (by PR) (ii) Barack e. [[ S ]] Barack = T iff (by FA, c, d) f. [[VP]] Barack ( [[DP]] Barack ) = T iff (by c) g. [ λx e : x smokes ] ( [[DP]] Barack ) = T iff (by d) h. [ λx e : x smokes ] ( Barack ) = T iff (by LC) i. Barack smokes 5

(16) Sample Derivation 2 Context: We are talking about Joe a. S is T iff (by notation) DP D He VP V smokes b. [[ S ]] Joe = T c. Subproof (i) [[ VP ]] Joe = (by NNx2, TN) (ii) [ λx e : x smokes ] d. Subproof (i) [[ DP ]] Joe = (by NNx 2) (ii) [[ he ]] Joe = (by PR) (ii) Joe e. [[ S ]] Joe = T iff (by FA, c, d) f. [[VP]] Joe ( [[DP]] Joe ) = T iff (by c) g. [ λx e : x smokes ] ( [[DP]] Joe ) = T iff (by d) h. [ λx e : x smokes ] ( Joe ) = T iff (by LC) i. Joe smokes (17) The Upshot of All This Our semantic interpretation function [[. ]] now comes paired with a superscript, g. This superscript which we call a variable assignment represents (certain features of) the context that a given phrase is being interpreted relative to. 6

4. Variable Assignments as Functions (18) Critical Problem for Our First Pass Account It is possible to have multiple instances of a given pronoun he in a single sentence, where each instance of the pronoun refers to a different entity. a. Illustration: Context: The speaker points first at Barack and then at Joe T-Conditions: He likes him is T iff Barack likes Joe But, if a variable assignment is only a single entity, then all pronouns in a sentence will have to be interpreted as referring to that same single entity. b. Illustration: (the reader is invited to confirm the following) [[ He likes him ]] Barack = T iff Barack likes Barack [[ He likes him ]] Joe = T iff Joe likes Joe. There s actually a solution to this problem that employs an idea originally proposed by syntacticians for dealing with exactly this problem (19) Solution: Indices There are two parts to this solution: one syntactic and one semantic. a. Syntactic Component Every instance of a pronoun in a sentence is assigned an index. We might represent these indices simply as numeric subscripts. (i) he 1 likes him 2. (ii) he 23 likes him 456. (iii) he 2 likes him 2. b. Semantic Component (Vague; Taken from Syntax) (i) Pronouns that receive the same index must refer to the same entity. [[He 1 smokes and he 1 dances]] g = T iff Barack smokes and Barack dances. (ii) Pronouns that receive different indices can refer to different entities. [[He 1 smokes and he 2 dances]] g = T iff Barack smokes and Joe dances. 7

But, how do we formalize this vaguely stated semantics for the notation of indices in (19b)? (20) Crucial Augmentation of Variable Assignments A variable assignment g is now no longer a single individual rather it is a (partial) function from natural numbers (indices) to the set of individuals. Illustration of Possible Variable Assignments s = { < 1, Obama > } h = { <1,Obama>, <2,Joe> } j = { <5, Bill>, <78, Obama>, <2098, Joe> } Side-Note: Our earlier variable assignments were taken to represent (in a direct fashion) the entity that we are talking about. Our new, functional variable assignments can still be thought of doing essentially the same thing: they are functions into the set of entities that we are talking about. You can (for now) think of the index associated with an entity x as something like the memory slot that is assigned to x in the course of the conversation. With our new variable assignments, we need a new rule for interpreting pronouns (21) Pronouns Rule (PR) [Heim & Kratzer (1998: 111)] If X is a pronoun bearing index n, and g is a variable assignment, and n is an index in the domain of g, then [[X n ]] g = g(n). Side-Note: The conventions laid out earlier in (13) and (14) may remain exactly as before. 8

(22) Illustration of the Rule PR a. [[ he 1 ]] s = (by PR) s(1) = (by definition of s in (20)) Obama b. [[ he 2 ]] h = (by PR) h(2) = (by definition of h in (20)) Joe c. [[ he 5 ]] j = (by PR) j(5) = (by definition of j in (20)) Bill d. [[ he 23 ]] h = (by PR) h(23) = (by definition of h in (20)) UNDEFINED!!! (23) Sample Derivation With these additions in place, we can now easily interpret sentences like (18a). Context: Speaker first points at Barack and then at Joe Variable Assignment (Reflecting the Context): g = { < 1, Barack >, <2, Joe > } a. S is T iff (by notation) DP 1 VP D V DP 2 He 1 likes D b. [[ S ]] g = T him 2 c. Subproof (i) [[ DP 1 ]] g = (by NNx2) (ii) [[ he 1 ]] g = (by PR) (iii) g(1) = (by definition of g) (iv) Barack 9

d. Subproof (i) [[ DP 2 ]] g = (by NNx2) (ii) [[ him 2 ]] g = (by PR) (iii) g(2) = (by definition of g) (iv) Joe e. Subproof (i) [[ V ]] g = (by NNx 2, TN) (ii) [ λx e : [ λy e : y likes x ] ] f. Subproof (i) [[ VP ]] g = (by FA, d, e) (ii) [[V]] g ( [[DP 2 ]] g ) = (by e, d) (iii) [ λx e : [ λy e : y likes x ] ] ( Joe ) = (by LC) (iv) [ λy e : y likes Joe ] g. [[ S ]] g = T iff (by FA, c, f) h. [[ VP ]] g ( [[ DP 1 ]] g ) = T iff (by c, f) i [ λy e : y likes Joe ](Barack) = T iff (by LC) j. Barack likes Joe (24) The Upshot Pronouns are represented as bearing an index (natural number) Variable assignments are functions from indices (numbers) to entities Thus, the variable assignment (still) implicitly represents features of the context: The entities we are referring to and which pronouns we are using to refer to which entity. Our rule of PR links the nature of the variable assignment (function from indices to entities) to the extension of the pronoun The extension of the pronoun depends upon (i) the index it bears, and (ii) the variable assignment (i.e., context ) it is interpreted with 10

5. Extending These Basic Tools to Definite Descriptions (24) The Problem of Contextual Restriction in Definite DPs a. Lexical Entry for the [[ the ]] = [ λf : f D <e,t> and there is exactly one x such that f(x) = T. the unique y such that f(y) = T ] b. Problematic Prediction: Since the argument of [[the]] must be true of exactly one entity, it seems that our system cannot interpret the following DPs (which we use all the time) (i) the cat (ii) the car (iii) the house (iv) the office (25) The Vaguely Stated Solution In any given context, there is actually only a very small, strict subset of D e that we are talking about, that we have in mind. Let s call this limited set of entities C (for contextually relevant entities ) When we use a definite DP like the NP, we are referring to that unique entity from C that satisfies [[NP]]. [[ the ]] = [ λf : f D <e,t> and there is exactly one x in C such that f(x) = T. the unique y in C such that f(y) = T ] Thus, even though we know there are many cats in the world (D e ), we can use the DP the cat in a context exactly when the set of contextually relevant entities (C) contains one and only one cat. (26) Problem Example If I own exactly one cat, then I can in my house say the cat is hungry If I own two cats, then I can t in my house say the cat is hungry (unless one of the other two cats is gone or something ) How do we augment our system so that we can explicitly state the relationship between the context and the set C that enters into the meaning of the? 11

(27) Step 1: A New Contextual Parameter In addition to our variable assignment g, let us introduce a further superscript to our interpretation function, the domain of discourse [[ XP ]] g, C = the interpretation of XP relative to the variable assignment g and the domain of discourse C a. Domain of Discourse, Informal Definition: The domain of discourse C is all the things that we are talking about, or all the things that we have in mind at a particular content b. Domain of Discourse, Formal Definition If g is the variable assignment, then C = the range of g (28) Illustration Suppose that s is the following variable assignment: {<1,Joe>, <2,Frank>, <3,Tom>} Consequently, if we are computing [[ XP ]] s, C, then C = {Joe, Frank, Tom} With this explicit, formal definition of C, we are able to augment our lexical entry for the definite determiner the, so that it is appropriately sensitive to C (29) New Lexical Entry for The [[ the ]] g,c = [ λf : f D <e,t> and there is exactly one x in C such that f(x) = T. the unique y in C such that f(y) = T ] (30) Illustration, Part 1 a. Context: Suppose we are at home, and that we own just one cat, Mittens. b. Sentence: The cat is hungry. c. Judgment: Sentence (30b) is interpretable, and is T iff Mittens is hungry. d. Derivation: Domain of Discourse, H = the things in our house { the sofa, the car, Mittens, } Key feature: domain of discourse (H) contains exactly one cat, Mittens 12

(i) S is T iff (by notation) DP VP D NP V AP The N is A cat hungry (ii) [[ S ]] g, H = T (iii) (iv) (v) (vi) Subproof: 1. [[VP]] g, H = (by FA, NNx3, TNx2, LC) 2. [ λx e : x is hungry ] Subproof: 1. [[NP]] g, H = (by NNx2, TN) 2. [ λx e : x is a cat ] Subproof 1. [[D]] g, H = (by NN, TN) 2. [ λf : f D <e,t> and there is exactly one x in H such that f(x) = T. the unique y in H such that f(y) = T ] Subproof 1. [[DP]] g, H = (by FA, iv, v) 2. [[D]] g, H ([[NP]] g, H ) = (by v) 3. [ λf : f D <e,t> and there is exactly one x in H such that f(x) = T. the unique y in H such that f(y) = T ] ([[NP]] g, H ) = (by LC) 4. the unique y in H such that [[NP]] g, H (y) = T = (by iv) 5. the unique y in H such that [ λx e : x is a cat ](y) = T = (by LC) 6. the unique y in H such that y is a cat = (by definition of H) 7. Mittens (vii) [[ S ]] g, H = T iff (by FA, iii, vi) (viii) [[VP]] g, H ( [[DP]] g, H ) = T iff (by iii) (ix) [ λx e : x is hungry ] ( [[DP]] g, H ) = T iff (by vi) (x) [ λx e : x is hungry ] ( Mittens ) = T iff (by LC) (xi) Mittens is hungry (31) Conclusion Our new semantics for the, augmented by its mention of the novel contextual parameter C (the domain of discourse), correctly predicts the fact that the cat is interpretable in a context where there is exactly one contextually salient cat. 13

(32) Illustration, Part 2 a. Context: Suppose we work at a pet store, surrounded by many different cats. b. Sentence: The cat is hungry. c. Judgment: Sentence (30a) is not interpretable (i.e., a listener could not assign an extension to it, since no extension for the phrase the cat can be determined.) d. Derivation Domain of Discourse, PS = the things at the pet store ; { the door, the cash register, Mittens, Fluffy, Patches, Boots, } Key feature: domain of discourse (PS) contains multiple cats (Mittens, Fluffy, Patches, Boots ) (i) S is T iff (by notation) DP VP D NP V AP The N is A cat hungry (ii) [[ S ]] g, PS = T (iii) (iv) (v) (vi) Subproof: 1. [[VP]] g, PS = (by FA, NNx3, TNx2, LC) 2. [ λx e : x is hungry ] Subproof: 1. [[NP]] g, PS = (by NNx2, TN) 2. [ λx e : x is a cat ] Subproof 1. [[D]] g, PS = (by NN, TN) 2. [ λf : f D <e,t> and there is exactly one x in PS such that f(x) = T. the unique y in PS such that f(y) = T ] Subproof 1. [[DP]] g, PS = STOP! 14

COMPUTATION HALTS: Since there is more than one x in PS such that [[cat]](x) = T, it follows that [[cat]] is not g, PS in the domain of [[the]] Thus, an interpretation for the DP the cat cannot be computed, and so an interpretation for the entire sentence cannot be computed. (33) General Summary In our treatment of pronouns, we introduced the idea that features of the context can be represented via superscripts to our interpretation function [[. ]] In this way, we can model the way in which those features of the context actually affect the extension that a given phrase / sentence receives. This provides us the tools to formally introduce the idea that the meaning of the definite determiner the depends upon what entities are contextually salient (in the domain of discourse ) This new semantics for the predicts that the NP is interpretable in a context C just in case there is exactly one x in C for which [[NP]](x) = T 6. The Role of Gender (and Other Features) on Pronominal Meaning In the system we have constructed thus far, the gender of the pronoun plays no role in limiting its interpretation. That is, nothing so far rules out a pronoun he bearing index n from being interpreted relative to a variable assignment that maps n to some woman. (34) Illustration: Vacuity of Gender a. Variable Assignment: g = { <1, Sally> } b. Computation (i) [[ he 1 ]] g = (by PR) (ii) g(1) = (by definition of g) (ii) Sally Clearly, we need to fix this! 15

(35) Facts to Capture a. Male Gender: A pronoun he bearing index n can only be interpreted relative to variable assignments that map n to some male entity. b. Female Gender: A pronoun she bearing index n can only be interpreted relative to variable assignments that map n to some female entity. (36) Step 1: The Syntactic Representation of Gender We want to model the contribution that gender features make to the interpretation of the pronoun. Given the set-up of our semantic system, it would be easiest to model this by assuming that pronouns are complex expressions. That is, although we pronounce it as a single word, the pronoun she actually has the complex structure in (a) below, whereby it consists of: o A gender feature [FEM] modifying o A pronominal core, which contributes the pronominal index itself The same would hold, mutatis mutandis for masculine pronouns (b). a. DP b. DP GEN D GEN D [FEM] D [MASC] D PRO n Pronounced as /ʃi/ PRO n Pronounced as /hi/ (37) Step 2: The Semantic Contribution of Gender a. Question: What is the semantic contribution of Gender? b. Observations: (i) Adding [FEM] to [PRO n ] creates a pronoun that can only receive an interpretation if the variable assignment sends n to a woman. (ii) Adding [MASC] to [PRO n ] creates a pronoun that can only receive an interpretation if the variable assignment sends n to a man. 16

c. Formal Proposal Let s assume the following: (i) [[FEM]] = [ λx : x D e and x is female. x ] The identity function on female entities. (ii) [[MASC]] = [ λx : x D e and x is male. x ] The identity function on male entities. d. Key Consequences (i) Suppose that she n is interpreted relative to a variable assignment g that maps n to some woman, Sally. [[ DP ]] g = (by FA) [[FEM]] g ([[D ]] g ) = (by NN) [[FEM]] g ([[PRO n ]] g ) = (by PR, TN) [ λx : x D e and x is female. x ](g(n)) = (by def. of g) [ λx : x D e and x is female. x ](Sally) = (by LC) Sally (ii) Suppose that she n is interpreted relative to a variable assignment g that maps n to some man, Dave. [[ DP ]] g = UNDEFINED! FA cannot apply! [[ D ]] g is not in the domain of [[GEN]] g [[GEN]] g = [[FEM]] g = [ λx : x D e and x is female. x ] [[D ]] g = [[PRO n ]] g = g(n) = Dave Dave is not in the domain of [ λx : x D e and x is female. x ] (38) General, Key Consequence Under the syntax in (36) and the semantics in (37c): a. She n can only receive an interpretation if the variable assignment g maps n to some female. (If g doesn t map n to a woman, then she n is just not interpretable). b. Thus, she n can only be used to refer to females! (A similar, parallel result clearly holds for the pronoun he n ). 17

This general approach can also (in principle) be extended to the other morpho-syntactic features of pronouns (i.e., person, number). Seeing in detail how to do this, however, requires a bit more machinery than what we have thus far But, in general, it seems possible to think of pronominal (phi-)features as introducing presuppositions in the way outlined above 18