Another look at PSRs: Intermediate Structure. Starting X-bar theory

Size: px
Start display at page:

Download "Another look at PSRs: Intermediate Structure. Starting X-bar theory"

Transcription

1 Another look at PSRs: Intermediate Structure Starting X-bar theory Andrew Carnie, 2006

2 Substitution Andrew Carnie, 2006

3 Substitution If a group of words can be replaced by a single word, they are a constituent. I saw [the teacher]/him. [the teacher] is a constituent

4 Substitution If a group of words can be replaced by a single word, they are a constituent. I saw [the teacher]/him. [the teacher] is a constituent If two constituents can be replaced by the SAME word, they are constituents of the same type. I saw [the teacher]/him. I saw [my crazy uncle]/him. [the teacher] and [my crazy uncle] are constituents of the same type (NP)

5 Flat Structure NP (D) (AdjP+) N (PP+) NP D AdjP N PP PP the student Adj tall P of NP P NP with N physics red hair

6 Flat Structure I saw the tall [student of physics] with red hair not the short [one] with brown hair. NP D AdjP N PP PP the student Adj tall P of NP P NP with N physics red hair

7 Flat Structure I saw the tall [student of physics] with red hair not the short [one] with brown hair. NP D AdjP N PP PP the student Adj tall P of NP P NP with N physics red hair

8 Flat Structure I saw the tall [student of physics with red hair] not the short [one]. NP D AdjP N PP PP the student Adj tall P of NP P NP with N physics red hair

9 Flat Structure I saw the tall [student of physics with red hair] not the short [one]. NP D AdjP N PP PP the student Adj tall P of NP P NP with N physics red hair

10 Flat Structure I saw this [tall student of physics with red hair] not that [one]. NP D AdjP N PP PP the student Adj tall P of NP P NP with N physics red hair

11 Flat Structure I saw this [tall student of physics with red hair] not that [one]. NP D AdjP N PP PP the student Adj tall P of NP P NP with N physics red hair

12 N Structure NP D the N AdjP N tall N PP N student PP of physics with red hair

13 N rules

14 N rules NP (D) N

15 N rules NP (D) N N (AdjP) N or N (PP)

16 N rules NP (D) N N (AdjP) N or N (PP) N N (PP)

17 N rules NP (D) N N (AdjP) N or N (PP) N N (PP) An iterative (self-recursive) rule: can apply as many times as needed

18 One-Replacement Replace an N node with [one]

19 One-Replacement Replace an N node with [one] not N, not NP

20 One replacement I saw that tall student of physics with red hair, not... NP D the N AdvP N tall N PP N student PP of physics with red hair

21 One replacement I saw that tall student of physics with red hair, not... NP D the N AdvP N tall N PP N student *the short [one] of chemistry PP of physics with red hair

22 One replacement I saw that tall student of physics with red hair, not... NP some of you might find this one grammatical -- this is a dialect issue D the N AdvP N tall N PP N student *the short [one] of chemistry PP of physics with red hair

23 One replacement I saw that tall student of physics with red hair, not... NP some of you might find this one grammatical -- this is a dialect issue the short [one] with brown hair D the N AdvP tall student *the short [one] of chemistry N N N PP of physics PP with red hair

24 One replacement some of you might find this one grammatical -- this is a dialect issue the short [one] with brown hair I saw that tall student of physics with red hair, not... NP D the N AdvP tall student *the short [one] of chemistry N N N PP of physics PP The short [one] with red hair

25 One replacement some of you might find this one grammatical -- this is a dialect issue the short [one] with brown hair I saw that tall student of physics with red hair, not... NP D the N AdvP tall student *the short [one] of chemistry N N N PP of physics This [one] PP The short [one] with red hair

26 One replacement I saw that tall student of physics with red hair, not... *[one] NP some of you might find this one grammatical -- this is a dialect issue the short [one] with brown hair D the N AdvP tall student *the short [one] of chemistry N N N PP of physics This [one] PP The short [one] with red hair

27 Flat Structure in VPs VP (AdvP+) V (NP) (AdvP+) (PP+) (AdvP+) VP AdvP V NP AdvP PP sings Adv N Adv P NP often opera loudly at N church

28 Flat Structure in VPs John often sings opera loudly at church and Mary [does so too]. VP AdvP V NP AdvP PP sings Adv N Adv P NP often opera loudly at N church

29 Flat Structure in VPs John often sings opera loudly at church and Mary [does so too]. VP AdvP V NP AdvP PP sings Adv N Adv P NP often opera loudly at N church

30 Flat Structure in VPs John often sings opera loudly at church and Mary frequently [does so too]. VP AdvP V NP AdvP PP sings Adv N Adv P NP frequently opera loudly at N church

31 Flat Structure in VPs John often sings opera loudly at church and Mary frequently [does so too]. VP AdvP V NP AdvP PP sings Adv N Adv P NP frequently opera loudly at N church

32 Flat Structure in VPs John often sings opera loudly at church but Mary rarely [does so] in the library. VP AdvP V NP AdvP PP sings Adv N Adv P NP rarely opera loudly in the library

33 Flat Structure in VPs John often sings opera loudly at church but Mary rarely [does so] in the library. VP AdvP V NP AdvP PP sings Adv N Adv P NP rarely opera loudly in the library

34 Flat Structure in VPs John often sings opera loudly at church but Mary rarely [does so] quietly in the library. VP AdvP V NP AdvP PP sings Adv N Adv P NP rarely opera quietly in the library

35 Flat Structure in VPs John often sings opera loudly at church but Mary rarely [does so] quietly in the library. VP AdvP V NP AdvP PP sings Adv N Adv P NP rarely opera quietly in the library

36 V Structure VP V this may seem mysterious, but we ve done it for a reason -- we ll see in chapter 8 AP V often V PP V AdvP in church Andrew Carnie, 2006 V sings NP opera loudly

37 V rules Andrew Carnie, 2006

38 V rules VP V (a vacuous rule)

39 V rules VP V (a vacuous rule) V (AdvP) V or V ({AdvP/PP})

40 V rules VP V (a vacuous rule) V (AdvP) V or V ({AdvP/PP}) V V (NP)

41 V rules VP V (a vacuous rule) V (AdvP) V or V ({AdvP/PP}) V V (NP) An iterative (self-recursive) rule: can apply as many times as needed

42 Do-so (too) replacement replace a V node with [did so (too)] not VP, not V

43 John often sings opera loudly in church and/but Mary... VP V AP V often V PP V AdvP in church V sings NP opera loudly

44 John often sings opera loudly in church and/but Mary... VP V AP V often V PP V AdvP in church V NP loudly sings opera *seldom does so folksongs quietly in the library

45 John often sings opera loudly in church and/but Mary... VP often seldom [does so] quietly in the library V sings V AP V V PP V AdvP NP loudly in church opera *seldom does so folksongs quietly in the library

46 John often sings opera loudly in church and/but Mary... VP seldom [does so] in the library V AP V often seldom [does so] quietly in the library V sings V PP V AdvP NP loudly in church opera *seldom does so folksongs quietly in the library

47 John often sings opera loudly in church and/but Mary... VP seldom [does so] in the library V AP V seldom [does so] often seldom [does so] quietly in the library V sings V PP V AdvP NP loudly in church opera *seldom does so folksongs quietly in the library

48 John often sings opera loudly in church and/but Mary... VP seldom [does so] in the library V AP V [does so too] seldom [does so] often seldom [does so] quietly in the library V sings V PP V AdvP NP loudly in church opera *seldom does so folksongs quietly in the library

49 Further Evidence for V VP V V PP V Conj V P NP and with V NP V NP eats tosses a fork beans salads

50 Flat Structure in PPs P P (NP) Tara is very in love with her boss PP (AdvP) P (NP) (PP)

51 Flat Structure in PPs P P (NP) Tara is very in love with her boss PP (AdvP) P (NP) (PP) ok, this only shows up with the idiom in love and fixed expressions like it So I m giving you a hokey story here.

52 Flat Structure in PPs PP (AdvP) P (NP) (PP) PP AP P NP PP in A N P NP very love with her boss

53 Flat Structure in PPs Mary was very in love with her boss, Susanna was less [so] PP AP P NP PP in A N P NP less love with her boss

54 Flat Structure in PPs Mary was very in love with her boss, Susanna was less [so] PP AP P NP PP in A N P NP less love with her boss

55 Flat Structure in PPs Mary was very in love with her boss, Susanna was less [so] with her husband. PP AP P NP PP in A N P NP less love with her husband

56 Flat Structure in PPs Mary was very in love with her boss, Susanna was less [so] with her husband. PP AP P NP PP in A N P NP less love with her husband

57 P rules Andrew Carnie, 2006

58 P rules PP P (a vacuous rule)

59 P rules PP P (a vacuous rule) P (AdvP) P or P (PP)

60 P rules PP P (a vacuous rule) P (AdvP) P or P (PP) P P (NP)

61 P rules PP P (a vacuous rule) P (AdvP) P or P (PP) P P (NP) An iterative (self-recursive) rule: can apply as many times as needed

62 P Structure PP P this may seem mysterious, but I ve done it for a reason -- we ll see in chapter 8 AP P very P in P PP NP with her boss love

63 P Structure PP P this may seem mysterious, but I ve done it for a reason -- we ll see in chapter 8 AP P very P in P PP NP with her boss love There is less evidence for this

64 What about AdjP and AdvP Is there intermediate structure in AdjP and AdvPs? There certainly are adjuncts: Lynn is interested in syntax but less [so] in phonology What about complements? There is a problem set on this (Challenge Problem 4) that you can try.

65 What about AdjP and AdvP For parsimony reasons, we will assume the following rules AdjP Adj (a vacuous rule) Adj (AdvP) P or Adv (PP) Adj Adj (PP) And the equivalent set of rules for Advs

66 The New Rules (to be revised) NP (D) N N (AdjP) N or N (PP) N N (PP) VP V V (AdvP) V or V ({AdvP/PP}) V V (NP) AdjP Adj Adj (AdvP) Adj Adj Adj (PP) PP P P (AdvP) P or P (PP) P P (NP) YIKES! Is there a simpler way? Are we missing any generalizations??

67 Generalization 1: 3 types of rules

68 Generalization 1: 3 types of rules For each major category there are 3 types of rules:

69 Generalization 1: 3 types of rules For each major category there are 3 types of rules: A rule that generates the phrase NP (D) N

70 Generalization 1: 3 types of rules For each major category there are 3 types of rules: A rule that generates the phrase NP (D) N A rule that iterates: N (AP) N

71 Generalization 1: 3 types of rules For each major category there are 3 types of rules: A rule that generates the phrase NP (D) N A rule that iterates: N (AP) N A rule that introduces the head N N (PP)

72 Generalization 1: 3 types of rules For each major category there are 3 types of rules: A rule that generates the phrase NP (D) N A rule that iterates: N (AP) N A rule that introduces the head N N (PP) Specifier rule

73 Generalization 1: 3 types of rules For each major category there are 3 types of rules: A rule that generates the phrase NP (D) N A rule that iterates: N (AP) N A rule that introduces the head N N (PP) Specifier rule Adjunct rule

74 Generalization 1: 3 types of rules For each major category there are 3 types of rules: A rule that generates the phrase NP (D) N A rule that iterates: N (AP) N A rule that introduces the head N N (PP) Specifier rule Adjunct rule Complement rule

75 Generalization 2: Headedness

76 Generalization 2: Headedness In each rule the only item that is obligatory is the item that gives its category to the node that dominates it:

77 Generalization 2: Headedness In each rule the only item that is obligatory is the item that gives its category to the node that dominates it: NP (D) N

78 Generalization 2: Headedness In each rule the only item that is obligatory is the item that gives its category to the node that dominates it: NP (D) N N (AP) N

79 Generalization 2: Headedness In each rule the only item that is obligatory is the item that gives its category to the node that dominates it: NP (D) N N (AP) N N N (PP)

80 Generalization 2: Headedness In each rule the only item that is obligatory is the item that gives its category to the node that dominates it: NP (D) N N (AP) N N N (PP) There are no rules of the form NP V AP. (this is called endocentricity)

81 Generalization 3: Optionality Andrew Carnie, 2006

82 Generalization 3: Optionality With the exception of determiners (more on that in chapter 6), all non-head material is both phrasal and optional

83 Generalization 3: Optionality With the exception of determiners (more on that in chapter 6), all non-head material is both phrasal and optional NP (D) N

84 Generalization 3: Optionality With the exception of determiners (more on that in chapter 6), all non-head material is both phrasal and optional NP (D) N N (AP) N

85 Generalization 3: Optionality With the exception of determiners (more on that in chapter 6), all non-head material is both phrasal and optional NP (D) N N (AP) N N N (PP)

86 Goals of X-bar theory Simplify the system of rules Capture intermediate structure Capture the cross-categorial generalizations. We will use VARIABLES to do this. A variable is a category that can stand for any other category. X, Y, W, Z are variables that can stand for ANY of N,V,A,P

87 The X-bar Rules (to be slightly revised) Specifier Rule: XP (YP) X Adjunct Rule: X (ZP) X or X X (ZP) Complement Rule: X X (WP) where X can stand for any category (N,V, Adj, Adv, P). X must be consistent through the 3 rules.

88 X-bar Structures XP YP X X ZP 1 X ZP 2 X WP

89 X-bar Structures NP YP N N ZP 1 N ZP 2 N WP

90 X-bar Structures VP YP V V ZP 1 V ZP 2 V WP

91 X-bar Structures AdjP YP Adj Adj ZP 1 Adj ZP 2 Adj WP

92 X-bar Structures AdvP YP Adv Adv ZP 1 Adv ZP 2 Adv WP

93 X-bar Structures PP YP P P ZP 1 P ZP 2 P WP

94 Summary Constituency tests show us there is intermediate structure in phrases. (evidence varies in strength) There are cross-categorial generalizations to be made: 3 rules: Specifier, adjunct, complement Headedness & Endocentricity Optionality of modifiers

95 Summary X-bar rules: Specifier Rule: XP (YP) X Adjunct Rule: X (ZP) X or X X (ZP) Complement Rule: X X (WP) This is still pretty messy. To do: discuss the differences between the specifier/complement/ adjunct rules Account for cross-linguistic variation tidy up some ugly loose ends (like the lack of motivation for the specifier rule, the fact that determiners aren t phrases, and the fact that the TP rule doesn t fit into the system.)

X-bar theory. X-bar :

X-bar theory. X-bar : is one of the greatest contributions of generative school in the filed of knowledge system. Besides linguistics, computer science is greatly indebted to Chomsky to have propounded the theory of x-bar.

More information

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

Ch. 2: Phrase Structure Syntactic Structure (basic concepts) A tree diagram marks constituents hierarchically Ch. 2: Phrase Structure Syntactic Structure (basic concepts) A tree diagram marks constituents hierarchically NP S AUX VP Ali will V NP help D N the man A node is any point in the tree diagram and it can

More information

CS 712: Topics in NLP Linguistic Phrases and Statistical Phrases

CS 712: Topics in NLP Linguistic Phrases and Statistical Phrases CS 712: Topics in NLP Linguistic Phrases and Statistical Phrases Pushpak Bhattacharyya, CSE Department, IIT Bombay 18 March, 2013 (main text: Syntax by Adrew Carnie, Blackwell Publication, 2002) Domination

More information

Models of Adjunction in Minimalist Grammars

Models of Adjunction in Minimalist Grammars Models of Adjunction in Minimalist Grammars Thomas Graf mail@thomasgraf.net http://thomasgraf.net Stony Brook University FG 2014 August 17, 2014 The Theory-Neutral CliffsNotes Insights Several properties

More information

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

(7) a. [ PP to John], Mary gave the book t [PP]. b. [ VP fix the car], I wonder whether she will t [VP]. CAS LX 522 Syntax I Fall 2000 September 18, 2000 Paul Hagstrom Week 2: Movement Movement Last time, we talked about subcategorization. (1) a. I can solve this problem. b. This problem, I can solve. (2)

More information

Artificial Intelligence

Artificial Intelligence CS344: Introduction to Artificial Intelligence Pushpak Bhattacharyya CSE Dept., IIT Bombay Lecture 20-21 Natural Language Parsing Parsing of Sentences Are sentences flat linear structures? Why tree? Is

More information

Sharpening the empirical claims of generative syntax through formalization

Sharpening the empirical claims of generative syntax through formalization Sharpening the empirical claims of generative syntax through formalization Tim Hunter University of Minnesota, Twin Cities ESSLLI, August 2015 Part 1: Grammars and cognitive hypotheses What is a grammar?

More information

Features. An argument DP must have been assigned Case by S-structure. A Specifier of IP must have been occupied by something by S-structure.

Features. An argument DP must have been assigned Case by S-structure. A Specifier of IP must have been occupied by something by S-structure. Features 26 October 2015 We left with a system that included the following elements. (1) Head Movement onstraint IfanX 0 movestoay 0,therecanbenoZ 0 thatisc-commandedbyy 0 and c-commandsx 0. (2) Like(s)

More information

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

CAS LX 522 Syntax I Fall 2000 October 10, 2000 Week 5: Case Theory and θ Theory. θ-theory continued CAS LX 522 Syntax I Fall 2000 October 0, 2000 Paul Hagstrom Week 5: Case Theory and θ Theory θ-theory continued From last time: verbs have θ-roles (e.g., Agent, Theme, ) to assign, specified in the lexicon

More information

SEMANTICS OF POSSESSIVE DETERMINERS STANLEY PETERS DAG WESTERSTÅHL

SEMANTICS OF POSSESSIVE DETERMINERS STANLEY PETERS DAG WESTERSTÅHL SEMANTICS OF POSSESSIVE DETERMINERS STANLEY PETERS DAG WESTERSTÅHL Linguistics Department, Stanford University Department of Philosophy, Göteborg University peters csli.stanford.edu, dag.westerstahl phil.gu.se

More information

2 A not-quite-argument for X-bar structure in noun phrases

2 A not-quite-argument for X-bar structure in noun phrases CAS LX 321 / GRS LX 621 Syntax: Introduction to Sentential Structure ovember 16, 2017 1 and pronouns (1) he linguists yodel. (2) We linguists yodel. (3) hey looked at us linguists. (4) hey looked at linguists.

More information

Constituency. Doug Arnold

Constituency. Doug Arnold Constituency Doug Arnold doug@essex.ac.uk Spose we have a string... xyz..., how can we establish whether xyz is a constituent (i.e. syntactic unit); i.e. whether the representation of... xyz... should

More information

Linearization. {α,β}= def. α and β aresisters

Linearization. {α,β}= def. α and β aresisters Linearization Linguistics 601 3 ecember 2015 Our starting position in thinking about linearization was built upon a view of phrase structure that distinguished maximal projections from intermediary phrases.

More information

Chiastic Lambda-Calculi

Chiastic Lambda-Calculi Chiastic Lambda-Calculi wren ng thornton Cognitive Science & Computational Linguistics Indiana University, Bloomington NLCS, 28 June 2013 wren ng thornton (Indiana University) Chiastic Lambda-Calculi NLCS,

More information

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

The Semantics of Definite DPs 1. b. Argument Position: (i) [ A politician ] arrived from Washington. (ii) Joe likes [ the politician ]. The Semantics of Definite DPs 1 Thus far, our semantics is able to interpret common nouns that occupy predicate position (1a). However, the most common position for common nouns to occupy is internal to

More information

CAS LX 522 Syntax I November 4, 2002 Week 9: Wh-movement, supplement

CAS LX 522 Syntax I November 4, 2002 Week 9: Wh-movement, supplement CAS LX 522 Syntax I November 4, 2002 Fall 2002 Week 9: Wh-movement, supplement () Italian Tuo fratello ( your brother ), [ CP a cui i [ TP mi domando [ CP che storie i [ TP abbiano raccontato t i t j...

More information

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

Semantics and Generative Grammar. A Little Bit on Adverbs and Events A Little Bit on Adverbs and Events 1. From Adjectives to Adverbs to Events We ve just developed a theory of the semantics of adjectives, under which they denote either functions of type (intersective

More information

The Formal Architecture of. Lexical-Functional Grammar. Ronald M. Kaplan and Mary Dalrymple

The Formal Architecture of. Lexical-Functional Grammar. Ronald M. Kaplan and Mary Dalrymple The Formal Architecture of Lexical-Functional Grammar Ronald M. Kaplan and Mary Dalrymple Xerox Palo Alto Research Center 1. Kaplan and Dalrymple, ESSLLI 1995, Barcelona Architectural Issues Representation:

More information

CMPT-825 Natural Language Processing. Why are parsing algorithms important?

CMPT-825 Natural Language Processing. Why are parsing algorithms important? CMPT-825 Natural Language Processing Anoop Sarkar http://www.cs.sfu.ca/ anoop October 26, 2010 1/34 Why are parsing algorithms important? A linguistic theory is implemented in a formal system to generate

More information

Wh-movement. CAS LX 522 Syntax I Fall 2001 November 6, 2001

Wh-movement. CAS LX 522 Syntax I Fall 2001 November 6, 2001 AS LX 522 Syntax I Fall 200 November 6, 200 Paul Hagstrom Week 9: Wh-movement Preliminary tree to remind ourselves: They will bake a cake. () P [ Q] T T VP will P bake they NP a N cake Verb bake needs

More information

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

Andrew Carnie, Structural Relations. The mathematical properties of phrase structure trees Structural Relations The mathematical properties of phrase structure trees Important! Important! Even if you have trouble with the formal definitions, try to understand the INTUITIVE idea behind them.

More information

Generalized Quantifiers Logical and Linguistic Aspects

Generalized Quantifiers Logical and Linguistic Aspects Generalized Quantifiers Logical and Linguistic Aspects Lecture 1: Formal Semantics and Generalized Quantifiers Dag Westerståhl University of Gothenburg SELLC 2010 Institute for Logic and Cognition, Sun

More information

On the Ungrammaticality of Remnant Movement in the Derivation of Greenberg's Universal 20

On the Ungrammaticality of Remnant Movement in the Derivation of Greenberg's Universal 20 On the Ungrammaticality of Remnant Movement in the Derivation of Greenberg's Universal 20 The MIT Faculty has made this article openly available. Please share how this access benefits you. Your story matters.

More information

Parsing with CFGs L445 / L545 / B659. Dept. of Linguistics, Indiana University Spring Parsing with CFGs. Direction of processing

Parsing with CFGs L445 / L545 / B659. Dept. of Linguistics, Indiana University Spring Parsing with CFGs. Direction of processing L445 / L545 / B659 Dept. of Linguistics, Indiana University Spring 2016 1 / 46 : Overview Input: a string Output: a (single) parse tree A useful step in the process of obtaining meaning We can view the

More information

Parsing with CFGs. Direction of processing. Top-down. Bottom-up. Left-corner parsing. Chart parsing CYK. Earley 1 / 46.

Parsing with CFGs. Direction of processing. Top-down. Bottom-up. Left-corner parsing. Chart parsing CYK. Earley 1 / 46. : Overview L545 Dept. of Linguistics, Indiana University Spring 2013 Input: a string Output: a (single) parse tree A useful step in the process of obtaining meaning We can view the problem as searching

More information

Grammar and Feature Unification

Grammar and Feature Unification Grammar and Feature Unification Problems with CF Phrase Structure Grammars Difficult to capture dependencies between constituents the boy runs the boys run * the boy run * the boys runs Problems with CF

More information

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

Semantics and Generative Grammar. The Semantics of Adjectival Modification 1. (1) Our Current Assumptions Regarding Adjectives and Common Ns The Semantics of Adjectival Modification 1 (1) Our Current Assumptions Regarding Adjectives and Common Ns a. Both adjectives and common nouns denote functions of type (i) [[ male ]] = [ λx : x D

More information

LING 130: Quantified Noun Phrases

LING 130: Quantified Noun Phrases LING 130: Quantified Noun Phrases from the handouts of James Pustejovsky March 31, 2011 1 The Type of a Quantified Expression Before Generalized Quantifiers were introduced, we only considered NPs that

More information

CH 59 SQUARE ROOTS. Every positive number has two square roots. Ch 59 Square Roots. Introduction

CH 59 SQUARE ROOTS. Every positive number has two square roots. Ch 59 Square Roots. Introduction 59 CH 59 SQUARE ROOTS Introduction W e saw square roots when we studied the Pythagorean Theorem. They may have been hidden, but when the end of a right-triangle problem resulted in an equation like c =

More information

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

1. Background. Task: Determine whether a given string of words is a grammatical (well-formed) sentence of language L i or not. Constraints in Syntax [1] Phrase Structure and Derivations Düsseldorf LSA/DGfS Summerschool 2002 Gereon Müller (IDS Mannheim) gereon.mueller@ids-mannheim.de 1. Background Task: Determine whether a given

More information

Ling 240 Lecture #15. Syntax 4

Ling 240 Lecture #15. Syntax 4 Ling 240 Lecture #15 Syntax 4 agenda for today Give me homework 3! Language presentation! return Quiz 2 brief review of friday More on transformation Homework 4 A set of Phrase Structure Rules S -> (aux)

More information

Other types of Movement

Other types of Movement Other types of Movement So far we seen Wh-movement, which moves certain types of (XP) constituents to the specifier of a CP. Wh-movement is also called A-bar movement. We will look at two more types of

More information

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

Semantics and Generative Grammar. Quantificational DPs, Part 3: Covert Movement vs. Type Shifting 1 Quantificational DPs, Part 3: Covert Movement vs. Type Shifting 1 1. Introduction Thus far, we ve considered two competing analyses of sentences like those in (1). (1) Sentences Where a Quantificational

More information

A Context-Free Grammar

A Context-Free Grammar Statistical Parsing A Context-Free Grammar S VP VP Vi VP Vt VP VP PP DT NN PP PP P Vi sleeps Vt saw NN man NN dog NN telescope DT the IN with IN in Ambiguity A sentence of reasonable length can easily

More information

A page from Willow s computer diary

A page from Willow s computer diary I ROBOT, YOU JANE A page from Willow s computer diary Things have always been strange here in Sunnydale. Since Buffy arrived in town we ve been able to understand it better. But the truth can be quite

More information

Recap: Lexicalized PCFGs (Fall 2007): Lecture 5 Parsing and Syntax III. Recap: Charniak s Model. Recap: Adding Head Words/Tags to Trees

Recap: Lexicalized PCFGs (Fall 2007): Lecture 5 Parsing and Syntax III. Recap: Charniak s Model. Recap: Adding Head Words/Tags to Trees Recap: Lexicalized PCFGs We now need to estimate rule probabilities such as P rob(s(questioned,vt) NP(lawyer,NN) VP(questioned,Vt) S(questioned,Vt)) 6.864 (Fall 2007): Lecture 5 Parsing and Syntax III

More information

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

Spring 2018 Ling 620 Introduction to Semantics of Questions: Questions as Sets of Propositions (Hamblin 1973, Karttunen 1977) Introduction to Semantics of Questions: Questions as Sets of Propositions (Hamblin 1973, Karttunen 1977) 1. Question Meanings and Sets of Propositions (1) The Semantics of Declarative Sentence Dave smokes

More information

Computationele grammatica

Computationele grammatica Computationele grammatica Docent: Paola Monachesi Contents First Last Prev Next Contents 1 Unbounded dependency constructions (UDCs)............... 3 2 Some data...............................................

More information

HPSG: Binding Theory

HPSG: Binding Theory HPSG: Binding Theory Doug Arnold doug@essexacuk Introduction Binding Theory is to do with the syntactic restrictions on the distribution of referentially dependent items and their antecedents: reflexives/reciprocals

More information

Context-Free Parsing: CKY & Earley Algorithms and Probabilistic Parsing

Context-Free Parsing: CKY & Earley Algorithms and Probabilistic Parsing Context-Free Parsing: CKY & Earley Algorithms and Probabilistic Parsing Natural Language Processing CS 4120/6120 Spring 2017 Northeastern University David Smith with some slides from Jason Eisner & Andrew

More information

Introduction to Semantics. The Formalization of Meaning 1

Introduction to Semantics. The Formalization of Meaning 1 The Formalization of Meaning 1 1. Obtaining a System That Derives Truth Conditions (1) The Goal of Our Enterprise To develop a system that, for every sentence S of English, derives the truth-conditions

More information

Raising and Passive. Jean Mark Gawron. Linguistics 522 San Diego State University

Raising and Passive. Jean Mark Gawron. Linguistics 522 San Diego State University Raising and Passive Jean Mark Gawron Linguistics 522 San Diego State University gawron@mail.sdsu.edu http://www.rohan.sdsu.edu/ gawron Raising and Passive p. 1/20 Sentences Part I Raising and Passive p.

More information

An introduction to mildly context sensitive grammar formalisms. Combinatory Categorial Grammar

An introduction to mildly context sensitive grammar formalisms. Combinatory Categorial Grammar An introduction to mildly context sensitive grammar formalisms Combinatory Categorial Grammar Gerhard Jäger & Jens Michaelis University of Potsdam {jaeger,michael}@ling.uni-potsdam.de p.1 Basic Categorial

More information

Quadratic Equations Part I

Quadratic Equations Part I Quadratic Equations Part I Before proceeding with this section we should note that the topic of solving quadratic equations will be covered in two sections. This is done for the benefit of those viewing

More information

Computational Linguistics II: Parsing

Computational Linguistics II: Parsing Computational Linguistics II: Parsing Left-corner-Parsing Frank Richter & Jan-Philipp Söhn fr@sfs.uni-tuebingen.de, jp.soehn@uni-tuebingen.de January 15th, 2007 Richter/Söhn (WS 2006/07) Computational

More information

Model-Theory of Property Grammars with Features

Model-Theory of Property Grammars with Features Model-Theory of Property Grammars with Features Denys Duchier Thi-Bich-Hanh Dao firstname.lastname@univ-orleans.fr Yannick Parmentier Abstract In this paper, we present a model-theoretic description of

More information

S NP VP 0.9 S VP 0.1 VP V NP 0.5 VP V 0.1 VP V PP 0.1 NP NP NP 0.1 NP NP PP 0.2 NP N 0.7 PP P NP 1.0 VP NP PP 1.0. N people 0.

S NP VP 0.9 S VP 0.1 VP V NP 0.5 VP V 0.1 VP V PP 0.1 NP NP NP 0.1 NP NP PP 0.2 NP N 0.7 PP P NP 1.0 VP  NP PP 1.0. N people 0. /6/7 CS 6/CS: Natural Language Processing Instructor: Prof. Lu Wang College of Computer and Information Science Northeastern University Webpage: www.ccs.neu.edu/home/luwang The grammar: Binary, no epsilons,.9..5

More information

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

Introduction to Semantics. Pronouns and Variable Assignments. We ve seen that implicatures are crucially related to context. Pronouns and Variable Assignments 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

More information

This kind of reordering is beyond the power of finite transducers, but a synchronous CFG can do this.

This kind of reordering is beyond the power of finite transducers, but a synchronous CFG can do this. Chapter 12 Synchronous CFGs Synchronous context-free grammars are a generalization of CFGs that generate pairs of related strings instead of single strings. They are useful in many situations where one

More information

CAS LX 523 Syntax II Spring 2001 March 13, (1) A qp. Kayne, Richard (1995). The antisymmetry of syntax. Cambridge, MA: MIT Press.

CAS LX 523 Syntax II Spring 2001 March 13, (1) A qp. Kayne, Richard (1995). The antisymmetry of syntax. Cambridge, MA: MIT Press. CAS LX 52 Syntax II Spring 200 March, 200 Paul Hagstrom Week 7: Antisymmetry Kayne, Richard (995). The antisymmetry of syntax. Cambridge, MA: MIT Press. Koopman, Hilda (2000). The spec-head configuration.

More information

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

Semantics and Generative Grammar. Pronouns and Variable Assignments 1. We ve seen that implicatures are crucially related to context. 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

More information

Ratios, Proportions, Unit Conversions, and the Factor-Label Method

Ratios, Proportions, Unit Conversions, and the Factor-Label Method Ratios, Proportions, Unit Conversions, and the Factor-Label Method Math 0, Littlefield I don t know why, but presentations about ratios and proportions are often confused and fragmented. The one in your

More information

Parsing Beyond Context-Free Grammars: Tree Adjoining Grammars

Parsing Beyond Context-Free Grammars: Tree Adjoining Grammars Parsing Beyond Context-Free Grammars: Tree Adjoining Grammars Laura Kallmeyer & Tatiana Bladier Heinrich-Heine-Universität Düsseldorf Sommersemester 2018 Kallmeyer, Bladier SS 2018 Parsing Beyond CFG:

More information

Chapter 26: Comparing Counts (Chi Square)

Chapter 26: Comparing Counts (Chi Square) Chapter 6: Comparing Counts (Chi Square) We ve seen that you can turn a qualitative variable into a quantitative one (by counting the number of successes and failures), but that s a compromise it forces

More information

Transformational Priors Over Grammars

Transformational Priors Over Grammars Transformational Priors Over Grammars Jason Eisner Johns Hopkins University July 6, 2002 EMNLP This talk is called Transformational Priors Over Grammars. It should become clear what I mean by a prior over

More information

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

Spring 2018 Ling 620 The Basics of Intensional Semantics, Part 1: The Motivation for Intensions and How to Formalize Them 1 The Basics of Intensional Semantics, Part 1: The Motivation for Intensions and How to Formalize Them 1 1. The Inadequacies of a Purely Extensional Semantics (1) Extensional Semantics a. The interpretation

More information

LIN1032 Formal Foundations for Linguistics

LIN1032 Formal Foundations for Linguistics LIN1032 Formal Foundations for Lecture 5 Albert Gatt In this lecture We conclude our discussion of the logical connectives We begin our foray into predicate logic much more expressive than propositional

More information

HPSG II: the plot thickens

HPSG II: the plot thickens Syntactic Models 2/21/06 HPSG II: the plot thickens 1 Passive: a lexical rule that rearranges ARG-ST! (1) Passive Lexical Rule < 1, tv - lxm ARG - ST INDEX i < FPSP 1 a, > part - lxm SYN HEAD FORM pass

More information

The algae who wanted to be a flower

The algae who wanted to be a flower The algae who wanted to be a flower Ana Cristina Tavares Illustration Joana Barata COIMBRA UNIVERSITY PRESS IMPRENSA DA UNIVERSIDADE DE COIMBRA Inquire is funded by the European Union within the 7th Framework

More information

Natural Language Processing CS Lecture 06. Razvan C. Bunescu School of Electrical Engineering and Computer Science

Natural Language Processing CS Lecture 06. Razvan C. Bunescu School of Electrical Engineering and Computer Science Natural Language Processing CS 6840 Lecture 06 Razvan C. Bunescu School of Electrical Engineering and Computer Science bunescu@ohio.edu Statistical Parsing Define a probabilistic model of syntax P(T S):

More information

CS460/626 : Natural Language

CS460/626 : Natural Language CS460/626 : Natural Language Processing/Speech, NLP and the Web (Lecture 23, 24 Parsing Algorithms; Parsing in case of Ambiguity; Probabilistic Parsing) Pushpak Bhattacharyya CSE Dept., IIT Bombay 8 th,

More information

Extensions to the Logic of All x are y: Verbs, Relative Clauses, and Only

Extensions to the Logic of All x are y: Verbs, Relative Clauses, and Only 1/53 Extensions to the Logic of All x are y: Verbs, Relative Clauses, and Only Larry Moss Indiana University Nordic Logic School August 7-11, 2017 2/53 An example that we ll see a few times Consider the

More information

Dependency grammar. Recurrent neural networks. Transition-based neural parsing. Word representations. Informs Models

Dependency grammar. Recurrent neural networks. Transition-based neural parsing. Word representations. Informs Models Dependency grammar Morphology Word order Transition-based neural parsing Word representations Recurrent neural networks Informs Models Dependency grammar Morphology Word order Transition-based neural parsing

More information

BARE PHRASE STRUCTURE, LCA AND LINEARIZATION

BARE PHRASE STRUCTURE, LCA AND LINEARIZATION Neuere Entwicklungen der Grammatiktheorie Universität Wien, SoSe 2008 Winfried Lechner wlechner@gs.uoa.gr Handout #2 BARE PHRASE STRUCTURE, LCA AND LINEARIZATION http://vivaldi.sfs.nphil.uni-tuebingen.de/%7ennsle01/synvie.htm

More information

10/17/04. Today s Main Points

10/17/04. Today s Main Points Part-of-speech Tagging & Hidden Markov Model Intro Lecture #10 Introduction to Natural Language Processing CMPSCI 585, Fall 2004 University of Massachusetts Amherst Andrew McCallum Today s Main Points

More information

CAS LX 500 Topics in Linguistics: Questions Spring 2006 March 2, b: Prosody and Japanese wh-questions

CAS LX 500 Topics in Linguistics: Questions Spring 2006 March 2, b: Prosody and Japanese wh-questions CAS LX 500 Topics in Linguistics: Questions Spring 2006 March 2, 2006 Paul Hagstrom 7b: Prosody and Japanese wh-questions Prosody by phase Prosody and syntax seem to fit quite tightly together. Ishihara,

More information

Hierarchical and Linear Constraints on Structure

Hierarchical and Linear Constraints on Structure Hierarchical and Linear Constraints on Structure Peter Sells Sandbjerg Ph.D. course June 14 16, 2006 Part II 1 OT Evaluations (1) CP XP C C IP Pro/Adv NP Adv I I Adv/Neg/NQ/Pro VP V Pro V NP NP PP V Prt

More information

Exploratory Factor Analysis and Principal Component Analysis

Exploratory Factor Analysis and Principal Component Analysis Exploratory Factor Analysis and Principal Component Analysis Today s Topics: What are EFA and PCA for? Planning a factor analytic study Analysis steps: Extraction methods How many factors Rotation and

More information

Control and Tough- Movement

Control and Tough- Movement Department of Linguistics Ohio State University February 2, 2012 Control (1/5) We saw that PRO is used for the unrealized subject of nonfinite verbals and predicatives where the subject plays a semantic

More information

Semantics 2 Part 1: Relative Clauses and Variables

Semantics 2 Part 1: Relative Clauses and Variables Semantics 2 Part 1: Relative Clauses and Variables Sam Alxatib EVELIN 2012 January 17, 2012 Reviewing Adjectives Adjectives are treated as predicates of individuals, i.e. as functions from individuals

More information

Some Concepts of Probability (Review) Volker Tresp Summer 2018

Some Concepts of Probability (Review) Volker Tresp Summer 2018 Some Concepts of Probability (Review) Volker Tresp Summer 2018 1 Definition There are different way to define what a probability stands for Mathematically, the most rigorous definition is based on Kolmogorov

More information

One hint from secondary predication (from Baker 1997 (8) A secondary predicate cannot take the goal argument as subject of predication, wheth

One hint from secondary predication (from Baker 1997 (8) A secondary predicate cannot take the goal argument as subject of predication, wheth MIT, Fall 2003 1 The Double Object Construction (Larson 1988, Aoun & Li 1989) MIT, 24.951, Fr 14 Nov 2003 A familiar puzzle The Dative Alternation (1) a. I gave the candy to the children b. I gave the

More information

Exploratory Factor Analysis and Principal Component Analysis

Exploratory Factor Analysis and Principal Component Analysis Exploratory Factor Analysis and Principal Component Analysis Today s Topics: What are EFA and PCA for? Planning a factor analytic study Analysis steps: Extraction methods How many factors Rotation and

More information

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

Spring 2017 Ling 620 The Semantics of Control Infinitives: A First Introduction to De Se Attitudes The Semantics of Control Infinitives: A First Introduction to De Se Attitudes 1. Non-Finite Control Complements and De Se Attitudes (1) Two Sentences that Seem Very Close in Meaning a. Dave expects he

More information

On Strict Cyclicity and Label: Toward Elimination of Late Merge*

On Strict Cyclicity and Label: Toward Elimination of Late Merge* On Strict Cyclicity and Label: Toward Elimination of Late Merge On Strict Cyclicity and Label: Toward Elimination of Late Merge* Takanori Nakashima Abstract In the Minimalist Program, strict cyclicity

More information

Sharpening the empirical claims of generative syntax through formalization

Sharpening the empirical claims of generative syntax through formalization Sharpening the empirical claims of generative syntax through formalization Tim Hunter University of Minnesota, Twin Cities ESSLLI, August 2015 Part 1: Grammars and cognitive hypotheses What is a grammar?

More information

1.5 MATHEMATICAL LANGUAGE

1.5 MATHEMATICAL LANGUAGE 1.5 MATHEMATICAL LANGUAGE Contemporary Calculus The calculus concepts we will explore in this book are simple and powerful, but sometimes subtle. To succeed in calculus you will have to master some techniques,

More information

Moreno Mitrović. The Saarland Lectures on Formal Semantics

Moreno Mitrović. The Saarland Lectures on Formal Semantics ,, 3 Moreno Mitrović The Saarland Lectures on Formal Semantics λ- λ- λ- ( λ- ) Before we move onto this, let's recall our f -notation for intransitive verbs 1/33 λ- ( λ- ) Before we move onto this, let's

More information

Probabilistic Context-free Grammars

Probabilistic Context-free Grammars Probabilistic Context-free Grammars Computational Linguistics Alexander Koller 24 November 2017 The CKY Recognizer S NP VP NP Det N VP V NP V ate NP John Det a N sandwich i = 1 2 3 4 k = 2 3 4 5 S NP John

More information

Recap: Tree geometry, selection, Θ-theory

Recap: Tree geometry, selection, Θ-theory Syntax II Seminar 2 Recap: Tree geometry, selection, Θ-theory Dr. James Grifiihs james.grifiihs@uni-konsianz.de Recap: tree geometry terminology M N O D E F H I J Branches 2 Recap: tree geometry terminology

More information

Decoding and Inference with Syntactic Translation Models

Decoding and Inference with Syntactic Translation Models Decoding and Inference with Syntactic Translation Models March 5, 2013 CFGs S NP VP VP NP V V NP NP CFGs S NP VP S VP NP V V NP NP CFGs S NP VP S VP NP V NP VP V NP NP CFGs S NP VP S VP NP V NP VP V NP

More information

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

Parasitic Scope (Barker 2007) Semantics Seminar 11/10/08 Parasitic Scope (Barker 2007) Semantics Seminar 11/10/08 1. Overview Attempts to provide a compositional, fully semantic account of same. Elements other than NPs in particular, adjectives can be scope-taking

More information

1 Rules in a Feature Grammar

1 Rules in a Feature Grammar 27 Feature Grammars and Unification Drew McDermott drew.mcdermott@yale.edu 2015-11-20, 11-30, 2016-10-28 Yale CS470/570 1 Rules in a Feature Grammar Grammar rules look like this example (using Shieber

More information

Scalar additives and their interaction with focus

Scalar additives and their interaction with focus 2 Restrictions on the position of focus 1 Introduction Scalar additives and their interaction with focus Maziar Toosarvandani University of California, Berkeley California Universities Semantics and Pragmatics

More information

DT2118 Speech and Speaker Recognition

DT2118 Speech and Speaker Recognition DT2118 Speech and Speaker Recognition Language Modelling Giampiero Salvi KTH/CSC/TMH giampi@kth.se VT 2015 1 / 56 Outline Introduction Formal Language Theory Stochastic Language Models (SLM) N-gram Language

More information

Lesson 21 Not So Dramatic Quadratics

Lesson 21 Not So Dramatic Quadratics STUDENT MANUAL ALGEBRA II / LESSON 21 Lesson 21 Not So Dramatic Quadratics Quadratic equations are probably one of the most popular types of equations that you ll see in algebra. A quadratic equation has

More information

MILLIONS AND BILLIONS STUDENT WORKSHEET

MILLIONS AND BILLIONS STUDENT WORKSHEET MILLIONS AND BILLIONS STUDENT WORKSHEET Name: Date: Problem 1: A) How tall is a stack of a million sheets of paper? B) How tall is a stack of a billion sheets of paper? 1. I would estimate that the height

More information

Logical Translations Jean Mark Gawron San Diego State University. 1 Introduction 2

Logical Translations Jean Mark Gawron San Diego State University. 1 Introduction 2 Logical Translations Jean Mark Gawron San Diego State University Contents 1 Introduction 2 2 Truth-Functional Connectives 2 2.1 And................................ 2 2.2 Or.................................

More information

Control and Tough- Movement

Control and Tough- Movement Control and Tough- Movement Carl Pollard February 2, 2012 Control (1/5) We saw that PRO is used for the unrealized subject of nonfinite verbals and predicatives where the subject plays a semantic role

More information

Notes from How to Prove it: A Structured Approach by Daniel J. Velleman

Notes from How to Prove it: A Structured Approach by Daniel J. Velleman Notes from How to Prove it: A Structured Approach by Daniel J. Velleman DeMorgan s laws: (P Q) is equivalent to P Q) (P Q) is equivalent to P Q) Commutative laws: (P Q) is equivalent to (Q P ) (P Q) is

More information

Discrete Mathematics and Probability Theory Fall 2013 Vazirani Note 12. Random Variables: Distribution and Expectation

Discrete Mathematics and Probability Theory Fall 2013 Vazirani Note 12. Random Variables: Distribution and Expectation CS 70 Discrete Mathematics and Probability Theory Fall 203 Vazirani Note 2 Random Variables: Distribution and Expectation We will now return once again to the question of how many heads in a typical sequence

More information

Parsing. Based on presentations from Chris Manning s course on Statistical Parsing (Stanford)

Parsing. Based on presentations from Chris Manning s course on Statistical Parsing (Stanford) Parsing Based on presentations from Chris Manning s course on Statistical Parsing (Stanford) S N VP V NP D N John hit the ball Levels of analysis Level Morphology/Lexical POS (morpho-synactic), WSD Elements

More information

Analyzing Extraction. N.B.: Each type has its own set of variables (Church typing).

Analyzing Extraction. N.B.: Each type has its own set of variables (Church typing). Analyzing Extraction Carl Pollard Linguistics 602.02 Mar. 8, 2007 (1) TLC Revisited To motivate our approach to analyzing nonlocal phenomena, we first look at a reformulation TLC of that makes explicit

More information

Algebra Exam. Solutions and Grading Guide

Algebra Exam. Solutions and Grading Guide Algebra Exam Solutions and Grading Guide You should use this grading guide to carefully grade your own exam, trying to be as objective as possible about what score the TAs would give your responses. Full

More information

T (s, xa) = T (T (s, x), a). The language recognized by M, denoted L(M), is the set of strings accepted by M. That is,

T (s, xa) = T (T (s, x), a). The language recognized by M, denoted L(M), is the set of strings accepted by M. That is, Recall A deterministic finite automaton is a five-tuple where S is a finite set of states, M = (S, Σ, T, s 0, F ) Σ is an alphabet the input alphabet, T : S Σ S is the transition function, s 0 S is the

More information

Linguistics 819: Seminar on TAG and CCG. Introduction to Combinatory Categorial Grammar

Linguistics 819: Seminar on TAG and CCG. Introduction to Combinatory Categorial Grammar Linguistics 819: Seminar on TAG and CCG Alexander Williams, 9 April 2008 Introduction to Combinatory Categorial Grammar Steedman and Dowty 1 The biggest picture Grammatical operations apply only to constituents.

More information

The Countenance of Quaint. Allyssa Bujdoso. Chaucer s Collective Works

The Countenance of Quaint. Allyssa Bujdoso. Chaucer s Collective Works The Countenance of Quaint By Allyssa Bujdoso Chaucer s Collective Works P.O. Box 2582 Chicago, IL 60690 859-468-9378 ACT I - SCENE I - MEGA BUS STOP Stage is set with stars and clouds hanging down, minimal

More information

Semantics I, Rutgers University Week 3-1 Yimei Xiang September 17, Predicate logic

Semantics I, Rutgers University Week 3-1 Yimei Xiang September 17, Predicate logic Semantics I, Rutgers University Week 3-1 Yimei Xiang September 17, 2018 Predicate logic 1. Why propositional logic is not enough? Discussion: (i) Does (1a) contradict (1b)? [Two sentences are contradictory

More information

Uniformity of Theta- Assignment Hypothesis. Transit i ve s. Unaccusatives. Unergatives. Double object constructions. Previously... Bill lied.

Uniformity of Theta- Assignment Hypothesis. Transit i ve s. Unaccusatives. Unergatives. Double object constructions. Previously... Bill lied. Preiously... Uniformity of Theta- Assignment Hypothesis, daughter of P = Agent, daughter of P = Theme PP, daughter of! = Goal P called P Chris P P books gae P to PP Chris Unaccusaties Transit i e s The

More information

Binding Theory Different types of NPs, constraints on their distribution

Binding Theory Different types of NPs, constraints on their distribution Binding Theory Different types of Ps, constraints on their distribution Ling 322 Read Syntax, Ch. 5 (Lecture notes based on Andrew Carnie s notes) 1 Different Types of Ps R-expressions An P that gets its

More information