Albert Gatt LIN3021 Formal Semantics Lecture 9. In this lecture Noun phrases as generalised quantifiers: some further concepts.

Slides:



Advertisements
Similar presentations
Artificial Intelligence
Advertisements

LING 364: Introduction to Formal Semantics Lecture 24 April 13th.
Semantics (Representing Meaning)
Kaplan’s Theory of Indexicals
Copyright © 2010, 2007, 2004 Pearson Education, Inc. Chapter 18 Sampling Distribution Models.
Grammars, constituency and order A grammar describes the legal strings of a language in terms of constituency and order. For example, a grammar for a fragment.
Basic Structures: Sets, Functions, Sequences, Sums, and Matrices
Basic Structures: Sets, Functions, Sequences, Sums, and Matrices
L41 Lecture 2: Predicates and Quantifiers.. L42 Agenda Predicates and Quantifiers –Existential Quantifier  –Universal Quantifier 
CAS LX 502 8a. Formal semantics Truth and meaning The basis of formal semantics: knowing the meaning of a sentence is knowing under what conditions.
Albert Gatt LIN3021 Formal Semantics Lecture 5. In this lecture Modification: How adjectives modify nouns The problem of vagueness Different types of.
Albert Gatt LIN1180 – Semantics Lecture 10. Part 1 (from last week) Theories of presupposition: the semantics- pragmatics interface.
Safety and Liveness. Defining Programs Variables with respective domain –State space of the program Program actions –Guarded commands Program computation.
CAS LX b. Questions. Seeking truth Much of what we’ve done this semester has to do with characterizing (our knowledge of) the conditions under which.
LTAG Semantics on the Derivation Tree Presented by Maria I. Tchalakova.
LING 364: Introduction to Formal Semantics Lecture 23 April 11th.
1 Undecidability Andreas Klappenecker [based on slides by Prof. Welch]
Installment 10b. Raising, etc CAS LX 522 Syntax I.
CAS LX a. A notational holiday. Sets A set is a collection of entities of any kind. They can be finite: {√2, John Saeed, 1984}. They can be infinite:
Programming Language Semantics Denotational Semantics Chapter 5 Part III Based on a lecture by Martin Abadi.
Logical and Rule-Based Reasoning Part I. Logical Models and Reasoning Big Question: Do people think logically?
Meaning and Language Part 1.
Lecture 1 Introduction: Linguistic Theory and Theories
February 2009Introduction to Semantics1 Logic, Representation and Inference Introduction to Semantics What is semantics for? Role of FOL Montague Approach.
Albert Gatt LIN 3098 Corpus Linguistics. In this lecture Some more on corpora and grammar Construction Grammar as a theoretical framework Collostructional.
CAS LX 502 Semantics 3a. A formalism for meaning (cont ’ d) 3.2, 3.6.
An investigation of Conservativity Tim Hunter Anastasia Conroy.
LIN1180/LIN5082 Semantics Lecture 3
Extending X-bar Theory DPs, TPs, and CPs. The Puzzle of Determiners  Specifier RuleXP  (YP) X’ – requires the specifier to be phrasal – *That the book.
Lecture 22 Tag Question Objectives: 1. The formation of question tag when the same operator used in the tag as in the main clause. 2.The formation of question.
Investment Analysis and Portfolio management Lecture: 24 Course Code: MBF702.
CAS LX 502 8b. Formal semantics A fragment of English.
Slide 1 Propositional Definite Clause Logic: Syntax, Semantics and Bottom-up Proofs Jim Little UBC CS 322 – CSP October 20, 2014.
Section 2.3 I, Robot Mind as Software McGraw-Hill © 2013 McGraw-Hill Companies. All Rights Reserved.
The Game of Algebra or The Other Side of Arithmetic The Game of Algebra or The Other Side of Arithmetic © 2007 Herbert I. Gross by Herbert I. Gross & Richard.
Reading: Chapter 4 (44-59) from the text book
Semantic Construction lecture 2. Semantic Construction Is there a systematic way of constructing semantic representation from a sentence of English? This.
Interpreting Language (with Logic)
Albert Gatt LIN3021 Formal Semantics Lecture 4. In this lecture Compositionality in Natural Langauge revisited: The role of types The typed lambda calculus.
LECTURE 2: SEMANTICS IN LINGUISTICS
Key Concepts Representation Inference Semantics Discourse Pragmatics Computation.
MATH 224 – Discrete Mathematics
CompSci 102 Discrete Math for Computer Science
Rules, Movement, Ambiguity
Section 2.1. Section Summary Definition of sets Describing Sets Roster Method Set-Builder Notation Some Important Sets in Mathematics Empty Set and Universal.
Slide 21-1 Copyright © 2004 Pearson Education, Inc.
1 Introduction to Abstract Mathematics Predicate Logic Instructor: Hayk Melikya Purpose of Section: To introduce predicate logic (or.
Chapter 2 With Question/Answer Animations. Section 2.1.
Algebra Problems… Solutions Algebra Problems… Solutions © 2007 Herbert I. Gross Set 17 part 2 By Herbert I. Gross and Richard A. Medeiros next.
Lecture 2 (Chapter 2) Introduction to Semantics and Pragmatics.
Albert Gatt LIN3021 Formal Semantics Lecture 8. In this lecture Noun phrases as generalised quantifiers.
ece 627 intelligent web: ontology and beyond
Lecture 1: Trace Theory.  We have seen that things move :  Arguments move out of the VP into subject position  Wh-phrases move out of IP into CP 
CAS LX 502 9b. Formal semantics Pronouns and quantifiers.
Albert Gatt LIN3021 Formal Semantics Lecture 3. Aims This lecture is divided into two parts: 1. We make our first attempts at formalising the notion of.
First-Order Logic Semantics Reading: Chapter 8, , FOL Syntax and Semantics read: FOL Knowledge Engineering read: FOL.
Lecture 041 Predicate Calculus Learning outcomes Students are able to: 1. Evaluate predicate 2. Translate predicate into human language and vice versa.
Metalogic Soundness and Completeness. Two Notions of Logical Consequence Validity: If the premises are true, then the conclusion must be true. Provability:
Quantified sentences TP NPT’ Det N’ every man smokes i.|| man || t (u) = 1 iff u  {x: x is a man in t} ii.|| smoke || t (u) = 1 iff u  {x: x smokes in.
Hypothesis Tests for 1-Proportion Presentation 9.
Logics for Data and Knowledge Representation ClassL (part 1): syntax and semantics.
Chapter 2 1. Chapter Summary Sets (This Slide) The Language of Sets - Sec 2.1 – Lecture 8 Set Operations and Set Identities - Sec 2.2 – Lecture 9 Functions.
7/3/2018 EMR 17 Logical Reasoning Lecture 11.
Chapter 2 Sets and Functions.
Structural relations Carnie 2013, chapter 4 Kofi K. Saah.
LING 581: Advanced Computational Linguistics
Logics for Data and Knowledge Representation
Logical and Rule-Based Reasoning Part I
Validity and Soundness, Again
Starting out with formal logic
Presentation transcript:

Albert Gatt LIN3021 Formal Semantics Lecture 9

In this lecture Noun phrases as generalised quantifiers: some further concepts

What we’ve said so far In a sentence of the form [[Det NP] subj VP] : The determiner itself is a function from sets (N) to sets (V) to truth values The NP subject (once the N combines with Det) is a function from sets to truth values This function takes as argument a set-denoting expression (namely, the denotation of the VP) It returns a truth value (the entire construction is a proposition) [[every man]] (e  t)  t [[walk]] (e  t) (the set of walkers)

What we’ve said so far So the GQ (the NP) in a sentence of the form [[Det NP] subj VP] can be thought of as a set of sets (a property of properties). We’re thinking of every man as saying: the property it combines with (walks) describes every man in our model.

The model-theoretic interpretation Suppose there are three men: Tom, Dick and Harry. Let’s think of every man as describing the set of all the properties that belong to each and every one of them In this model: Every man does describe the (extension of) the property walk But not of skip or fish So every man walks is true just in case the property (set) walk is a member of the set of things described by every man. Alternatively, it’s true just in case every man is indeed a man who walks. walkskipfish TomYYN DickYNN harryyyY

In graphics walkskipfish TomYYN DickYNN harryyyY Tom Harry Dick walk fish skip Every man: Contains walk but not skip or fish

Part 1 “Universal” restrictions on Natural Language Quantifiers

GQs and semantic universals One of the questions that semanticists have asked is: What are the properties of Natural Language quantifiers, and what restrictions can there be on the way languages express quantified NPs? Are there generalisations that we can make which apply cross- linguistically?

Observation 1: conservativity When we interpret a GQ of the form [Det NP] in a model, we are normally not interested in the whole of U. To verify every man runs, we’re only interested in the men, not in the women. (Whether the women run or not is irrelevant.) One of the properties that GQs apparently have is conservativity

Observation 1: conservativity Observe that: Every man walks is true iff every man is a man who walks Few athletes take drugs is true iff few athletes are athletes who take drugs So in [[DET N] V], it is always [[N]] that sets the scene, and we’re interested in that part of [[V]] which intersects with [[N]] What the examples suggest is that [[Det N] subj V] is being interpreted as a relation between [[N]] and [[V]], and the property [[N]] is being “carried over” into the interpretation of [[V]]

Observation 1: conservativity Tom Harry Dick walk fish skip Every man: Contains walk but not skip or fish We could make this generalisation (assuming a model, as usual): If N, V are subsets of U then: DET(N)(V) is true iff DET(N)(N  V)

What does conservativity tell us? Barwise and Cooper (1981) hypothesise the following universal: Every NL Quantifier is conservative. Let’s imagine a quantifier allnon, where allnon N means “everything which is not an N”. Therefore: allnon(N)(V) is true iff (U-N)  V (Note: this is a bit like every, but every N V would require that N  V) This quantifier violates conservativity. Compare: All students smoke = all students are students who smoke Allnon students smoke =/= allnon students are students who smoke

What does conservativity tell us? The example of allnon suggests that: It’s not difficult to think of determiners that violate conservativity. Therefore, the conservativity universal makes a very strong empirical claim, one that has surprising consequences. (Why should quantifiers like allnon be excluded from Natural Languages?)

What does conservativity tell us? One consequence of Conservativity (if it’s true) is that some things frequently regarded as determiners might not be determiners after all. Only athletes run. We can’t verify this only by taking into account the intersection of athletes and running things. We need to check that it is only athletes that run, so we need to look at non- running and non-athlete things as well. So only violates Conservativity. But maybe only isn’t really a determiner at all! Note that this semantic argument is supported by syntactic distribution: Every man walks. VS *man every walks Only athletes run VS athletes only run *the every man VS the only man

Observation 2: Extension (constancy) The truth of the proposition every woman sneezes in a model M = is independent of the size of U. If we extend our model to U’, by adding non-woman and non-sneezing things to U, the truth is unaffected. So we can ignore U-[[N]] and U-[[V]] in our interpretation. So: If [[N]], [[V]] are subsets of U and U is a subset of U’ then: DET(N)(V) is true in U iff DET(N)(V) is true in U’

Observation 2: Extension (constancy) If [[N]], [[V]] are subsets of U and U is a subset of U’ then: DET(N)(V) is true in U iff DET(N)(V) is true in U’ But not all determiners pass this test (it’s not a universal property). Some determiners are very sensitive to the size of the domain: Many women sneeze = many things which are women sneeze (and some women don’t) = the number of women who sneeze is greater than the number of other (non- women) things that sneeze. On this interpretation, we do need to consider U-[[N]] and U-[[V]]

Observation 3: Quantity We’ve said that extending the domain U to include things not in [[N]] and [[V]] should have no effect on [[DET N] V] With some determiners, we do care about how many N’s and V’s there are: Several men walk does require us to consider the number of things in [[man]]. Note: it doesn’t matter who the men are! Suppose: we have two models M1 and M2 with domains U1 and U2 there are equal numbers of men in U1 and U2 (i.e. For every man in U1, there is a corresponding man in U2) The models are otherwise identical (including the interpretation of predicates) then the truth of several men walk should stay the same in the two models, if we have a mapping from each man in M1 to a man in M2

Observation 3: Quantity We can specify this by assuming that there is a mapping from each individual N in U1 to each individual N in U2. Tom Dick Harry U1 Jake Roger Kees U2 If it’s possible to map each N in U1 to each N in U2 and vice versa (we don’t care about identity of the men), then we can determine that we have equally sized sets. We specify a bijection F: U1 to U2, s.t. For each x in U1, there is a unique F(x) in U2

Observation 3: Quantity If F is a bijection from U1 to U2, then: DET(N)(V) is true in M1 iff DET(F(A))(F(B)) is true in M2 Some so-called determiners in English don’t satisfy Quantity. Every student’s book is by Chomsky Possessives like every student’s are often viewed as determiners (syntactically, they seem to behave the same) The problem here is that interpreting every student’s book needs to take into account the individual, specific relation between a student and their book.

Part 2 Generalised quantifiers and negative polarity items

Negative polarity items Some expressions seem to be biased towards “negative” shades of meaning: Nobody has ever been there. No person in this room has any money. *The people have ever been there. *Jake has any money.

Negative polarity items But in some non-negative contexts, an NPI seems ok: *The people have ever been there. Have people ever been there? If people have ever been there, I’ll be very surprised. *Jake has any money. Has Jake got any money? If Jake has any money he should pay for his own drinks. The relevant contexts include questions, if-clauses etc

Negative polarity items NPIs are also ok with certain generalised quantifiers, but not others. *The people have ever been there. Every person who’s ever been here was stunned. *Some person who’s ever been here was stunned. *Jake has any money. Every man who has any money should buy a round. *Some man who has any money should buy a round.

Negative polarity items There’s a difference between an NPI within the GQ and an NPI in the VP: NPI inside quantifier: Every man who has ever met Mary loved her. No man who has ever met Mary loved her. *Some man who has ever met Mary loved her. *Three men who have ever met Mary loved her. NPI inside predicate *Every man has ever met Mary. No man has ever met Mary. *Some man has ever met Mary. *Three men have ever met Mary loved her.

An aside about entailments Recall the definition of hyponymy: I am a man  I am a human being. Entailment from a property (man) to a super-property (human) Upward entailment (specific to general) I am not a human being  I am not a man Entailment from a property (human) to a sub-property (man) Downward entailment (general to specific) Notice that negation reverses the entailment with hyponyms

How quantifiers come into the picture A quantifier is doubly unsaturated: it combines with two properties: (DET N) V We’re interested in how quantifiers behave with respect to upward and downward entailments.

Every N V Every human being walks First property (inside the GQ) DE ok  Every man walks. UE blocked: Every animal walks. Second property (VP): DE blocked: Every human being walks fast. (not downward entailing) UE ok  Every human being moves.

Some N V Some human being walks First property (inside the GQ) DE blocked: Some man walks. UE OK: Some animal walks. Second property (VP): DE blocked: Some human being walks fast. UE ok: Some human being moves.

Three N V Three human beings walk First property (inside the GQ) DE blocked: Three men walk. UE OK: Three animals walk. Second property (VP): DE blocked: Three human beings walk fast. UE ok: Three human beings move.

No N V No human beings walk First property (inside the GQ) DE Ok: No men walk. UE blocked: No animals walk. Second property (VP): DE OK: No human beings walk fast. UE blocked: No human beings move.

Summary First PropertySecond Property DEUEDEUE EveryYNNY NoYNYN SomeNYNY ThreeNYNY

NPIs are licensed in DE contexts First PropertySecond Property DEUEDEUE EveryYNNY NoYNYN SomeNYNY ThreeNYNY Every man who has ever seen Mary loved her. *Every man has ever seen Mary. No man who has ever seen Mary loved her. No man has ever seen Mary. *Some man who has ever seen Mary loved her. *Some man has ever seen Mary. *Three men who have ever seen Mary loved her. *Three men have ever seen Mary.

Important things to note Generalised quantifiers have upward or downward entailments. This depends on the quantifier itself. The entailments apply in the NP and/or the VP (the fact that the quantifier has entailments in both suggests we’re correct in adopting the generalised quantifier analysis, where the quantifier is a relation between N and V) The entailments of quantifiers seem to play a causal role in where they are allowed to appear in combination with NPIs

What about other languages? Can you think of the DE/UE entailments in languages such as Italian and English? What are the counterparts of NPIs in these languages? Are they licensed in the same way? Could we claim that this is a semantic universal?