Pauline Jacobson, 1999.  General introduction: compositionality, syntax/semantics interface, notation  The standard account  The variable-free account.

Slides:



Advertisements
Similar presentations
But… Why not to have a syntax built on the same principles as those of semantic composition?
Advertisements

Brief Introduction to Logic. Outline Historical View Propositional Logic : Syntax Propositional Logic : Semantics Satisfiability Natural Deduction : Proofs.
What is he doing?.
October 2004CSA4050: Semantics III1 CSA4050: Advanced Topics in NLP Semantics III Quantified Sentences.
Help me out.
Computational language: week 10 Lexical Knowledge Representation concluded Syntax-based computational language Sentence structure: syntax Context free.
Natural Language Processing Syntax. Syntactic structure John likes Mary PN VtVt NP VP S DetPNVtVt NP VP S Every man likes Mary Noun.
 Christel Kemke 2007/08 COMP 4060 Natural Language Processing Feature Structures and Unification.
CSA2050: DCG I1 CSA2050 Introduction to Computational Linguistics Lecture 8 Definite Clause Grammars.
First-Order Logic (and beyond)
Semantics (Representing Meaning)
Anders Holmberg CRiLLS.  The grammar of a language L: The set of categories, rules, and principles which relate sound to meaning in L  Speech sound.
Language and Cognition Colombo, June 2011 Day 2 Introduction to Linguistic Theory, Part 4.
Linguistic Theory Lecture 7 About Nothing. Nothing in grammar Language often contains irregular paradigms where one or more expected forms are absent.
SYNTAX Introduction to Linguistics. BASIC IDEAS What is a sentence? A string of random words? If it is a sentence, does it have to be meaningful?
PSY 369: Psycholinguistics Some basic linguistic theory part2.
Language (and Decomposition). Linguistics provides… a highly articulated “computational” (generative) theory of the mental representations of language.
LING NLP 1 Introduction to Computational Linguistics Martha Palmer April 19, 2006.
Pronoun Antecedent Agreement. What is a pronoun? A pronoun is a substitute for a noun. For example: He assigned his class homework. They complained until.
Linguistic Theory Lecture 8 Meaning and Grammar. A brief history In classical and traditional grammar not much distinction was made between grammar and.
LTAG Semantics on the Derivation Tree Presented by Maria I. Tchalakova.
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:
June 7th, 2008TAG+91 Binding Theory in LTAG Lucas Champollion University of Pennsylvania
Natural Language Query Interface Mostafa Karkache & Bryce Wenninger.
Week 13a. QR CAS LX 522 Syntax I. Quantifiers We interpret Bill saw everyone as We interpret Bill saw everyone as For every person x, Bill saw x. For.
Meaning and Language Part 1.
Models of Generative Grammar Smriti Singh. Generative Grammar  A Generative Grammar is a set of formal rules that can generate an infinite set of sentences.
Syntax.
Grammar Nuha Alwadaani.
Syntax Nuha AlWadaani.
1st 100 sight words.
February 2009Introduction to Semantics1 Logic, Representation and Inference Introduction to Semantics What is semantics for? Role of FOL Montague Approach.
Introduction to English Syntax Level 1 Course Ron Kuzar Department of English Language and Literature University of Haifa Chapter 2 Sentences: From Lexicon.
Unit 3 Reference and Sense
Continuous Discontinuity in It-Clefts Introduction Tension between the two approaches Our proposal: TAG analysis Equative it-cleft: It was Ohno who won.
ASPECTS OF LINGUISTIC COMPETENCE 4 SEPT 09, 2013 – DAY 6 Brain & Language LING NSCI Harry Howard Tulane University.
Binding Theory Describing Relationships between Nouns.
SYNTAX Lecture -1 SMRITI SINGH.
Psycholinguistic Theory
1 Special Electives of Comp.Linguistics: Processing Anaphoric Expressions Eleni Miltsakaki AUTH Fall 2005-Lecture 2.
1 LIN 1310B Introduction to Linguistics Prof: Nikolay Slavkov TA: Qinghua Tang CLASS 24, April 3, 2007.
October 2004CSA4050: Semantics III1 CSA4050: Advanced Topics in NLP Semantics III Quantified Sentences.
Markus Egg, Alexander Koller, Joachim Niehren The Constraint Language for Lambda Structures Ventsislav Zhechev SfS, Universität Tübingen
Computational Semantics Day 5: Inference Aljoscha.
Said and told Monday, August 01 st. Said and Told Said have similar meaning Tell.
Semantic Construction lecture 2. Semantic Construction Is there a systematic way of constructing semantic representation from a sentence of English? This.
Albert Gatt LIN3021 Formal Semantics Lecture 4. In this lecture Compositionality in Natural Langauge revisited: The role of types The typed lambda calculus.
Rules, Movement, Ambiguity
1 Context Free Grammars October Syntactic Grammaticality Doesn’t depend on Having heard the sentence before The sentence being true –I saw a unicorn.
1 Principles & Parameters Approach in Linguistics - IV Bibhuti Bhusan Mahapatra.
Linguistic Theory Lecture 5 Filters. The Structure of the Grammar 1960s (Standard Theory) LexiconPhrase Structure Rules Deep Structure Transformations.
Unit 4: REFERRING EXPRESSIONS
CAS LX a. Discourse Representation Theory 10.9.
1 Syntax 1. 2 In your free time Look at the diagram again, and try to understand it. Phonetics Phonology Sounds of language Linguistics Grammar MorphologySyntax.
SYNTAX.
Safir, Ken Vehicle Change and Reconstruction. Linguistic Inquiry. Vol. 30-4: Vehicle Change and Reconstruction in Ā-Chains Safir (1999)
3 Phonology: Speech Sounds as a System No language has all the speech sounds possible in human languages; each language contains a selection of the possible.
Human and Machine Understanding of normal Language (NL) Character Strings Presented by Peter Tripodes.
Professor Ian Roberts having seen the two main types of rule systems (PS- rules/X’-theory and movement/transformational rules), we now.
Meaning and Language Part 1. Plan We will talk about two different types of meaning, corresponding to two different types of objects: –Lexical Semantics:
Lec. 10.  In this section we explain which constituents of a sentence are minimally required, and why. We first provide an informal discussion and then.
SYNTAX.
10/31/00 1 Introduction to Cognitive Science Linguistics Component Topic: Formal Grammars: Generating and Parsing Lecturer: Dr Bodomo.
Basic Parsing with Context Free Grammars Chapter 13
SYNTAX.
Chapter Eight Syntax.
Chapter Eight Syntax.
CSA4050: Advanced Topics in NLP
David Kauchak CS159 – Spring 2019
Presentation transcript:

Pauline Jacobson, 1999

 General introduction: compositionality, syntax/semantics interface, notation  The standard account  The variable-free account  Experimental support  Objections, further research  Discussion

 The surface is its best model (as in A.I.!): ◦ No abstract levels of representation ◦ No variables ◦ No assignment functions  Smooth syntax-semantics interface (Categorial Grammar)  Direct compositionality

 Standard semantics: Some constituents have no meaning until they are mapped to another abstract level  Variable-free semantics: “Each local surface syntactic constituent has a meaning” (hypothesis of local interpretation)

 Mary loves and John hates stroopwafels.  Non compositional: ◦ Mary loves stroopwafels and John hates stroopwafels.  Compositional: ◦ Mary loves and John hates = ◦ Meaning here is a function from individuals to properties

 Rationale: pronouns act like nouns ◦ Every man said that every woman thinks that she should talk to him ◦ Every man said that every woman thinks that Mary should talk to him ◦ Every man said that every woman thinks that Mary should talk to John  Same syntactic distribution  Same syntactic category  Same semantic category  Pronouns are like nouns!

 Binding ◦ Every man thinks that he lost ◦ Thinks that he lost  ◦ Think’(lost’(x)) (open property – unbound variable) ◦ λx[think’(lost(x))(x)] (shifts into a function from assignment functions to properties)

Pronouns are treated as variables Binding is made via a meaning-shift rule Pronoun are of type NP / Each linguistic expression has a meaning relative to some assignment function

 Problems ◦ Ad-hoc solution with global consequences:  Assignment functions are omnipresent but only useful in the case of pronouns ◦ ‘John likes x 1 ’ and ‘John likes x 2 ’ never function like different semantic objects  ‘John thinks [Mary loves him]’  ‘Frank thinks [Mary loves him]’

 There is no such thing as an “open expression”  Use parallel syntactic and semantic shifts to account for anaphora (pronouns)

 John said Mary loves him  λx[said’(loves’(x)(m))(j)]  How do we avoid treating Mary as the lovee?  Him = type NP NP  NP NP is a syntactic category, with semantic implications  Not just a “fancy NP”!

 How do we treat “Mary loves him”? ◦ G-rule:

 How do we treat “Mary loves him”? ◦ Z-rule

 A pronoun is not a variable ◦ Pronouns denote the identity function  Binding by Z/G-rule  Local semantic effect  Pronouns have a meaning relative to some individual

“Who does every Englishman admire? His mother.”  =What is the function such that every- Englishman’(λx[admire’(f(x))(x)])?

 Standard account: ◦ =Who does every Englishman admire (t)? ◦ The trace t is complex: it is “a variable over functions of type applied to a variable over individuals”

 Variable free account: ◦ Admires = (S/NP)/NP (by z)  (S/NP)/NP NP ◦ Every-englishman * z(admire) = S/ NP NP ◦  there is a gap of type NP NP ;

 “Every man i loves and no man marries his i mother”

 Standard account: No VP on which to apply a type-shift ◦ Requires use of reconstruction (loss of direct compositionality) ◦ Or traces ◦ But both lead to problems with generalizations: “Every boy k says that every man j loves his j mother and no man marries his k mother”

 Variable-free: ◦ λf[every-man’(λx[love’(f(x))(x)]) Λ no- man’(λy[marries’(f(y))(y)])] ◦ Works thanks to the locality of the pronoun meaning

 « Functional questions » aren’t so convincing  The semantic distinction between pronouns and nouns is not always clear ◦ Cross-sentential anaphora ◦ Intuitive understanding of the nature of pronouns  Donkey pronouns ◦ Every farmer who owns a donkey beats it.

Standard accountVariable-free account Pronoun = variablePronoun = no variable Binding by meaning-shift ruleBinding by z/g-rule Pronoun ~ NP / Pronoun ~NP NP / More local semantic effect Variables are distinctPronouns have the same identity function Each linguistic expression has a meaning relative to some assignment function Pronouns have a meaning relative to some individual