Recap: Tree geometry, selection, Θ-theory
|
|
- Edwina Taylor
- 5 years ago
- Views:
Transcription
1 Syntax II Seminar 2 Recap: Tree geometry, selection, Θ-theory Dr. James Grifiihs james.grifiihs@uni-konsianz.de
2 Recap: tree geometry terminology M N O D E F H I J Branches 2
3 Recap: tree geometry terminology M N O D E F H I J Branches 3
4 Recap: tree geometry terminology M N O D E F H I J Branches Nodes Label 4
5 Recap: tree geometry terminology M N O D E F H I J Branches Nodes Label = name given io a node 5
6 Recap: tree geometry terminology M Rooi node N O D E F H I J Branches Nodes Label = name given io a node 6
7 Recap: tree geometry terminology M Rooi node N O D E F H I J Terminal node Branches Nodes Label = name given io a node 7
8 Recap: tree geometry terminology M Rooi node N O Non-ierminal node D E F H I J Terminal node Branches Nodes Label = name given io a node 8
9 Recap: tree geometry terminology M N O D E F H I J Dominance 9
10 Recap: tree geometry terminology M N O D E F H I J Dominance = N1 dominaies N2 if N1 is higher in ihe iree ihan N2 and ihere is a paih conneciing N1 io N2. 10
11 Recap: tree geometry terminology M N O D E F H I J Immediate dominance = 11
12 Recap: tree geometry terminology M N O D E F H I J Immediate dominance = N1 dominaies N2 if N1 is higher in ihe iree ihan N2 and ihere is a paih conneciing N1 io N2 and ihere is no node on ihe paih beiween N1 and N2 O is ihe moiher of H H is ihe daughier of O 12
13 Recap: tree geometry terminology M N O D E F H I J Sister = 13
14 Recap: tree geometry terminology M N O D E F H I J Sister = N1 and N2 are sisiers if ihey have ihe same moiher 14
15 Recap: tree geometry terminology M N O D E F H I J Precedence = 15
16 Recap: tree geometry terminology M N O D E F H I J Precedence = N1 precedes N2 if N1 does noi dominaie N2 and N1 is ihe lefiward sisier (or is dominaied by ihe lefiward sisier) of N2 (or a node ihai dominaies N2). 16
17 Recap: tree geometry terminology M N O D E F H I J C-command = 17
18 Recap: tree geometry terminology M N O D E F H I J C-command = N1 c-commands iis sisier N2 and all of ihe nodes ihai N2 dominaies. Symmetric c-command = when N1 and N2 c-command each oiher. 18
19 Recap: tree geometry terminology XP WP X X YP Complement = Sisier io X Specifer = Sisier io X 19
20 Dominance N1 dominaies N2 if N1 is higher in ihe iree ihan N2 and ihere is a paih conneciing N1 io N2. Mother N1 is ihe moiher of N2 if N1 immediaiely dominaies N2 Sister N1 and N2 are sisiers if ihe have ihe same moiher Precedence N1 precedes N2 if N1 is lefiward of N2 C-command N1 c-commands iis sisier N2 and all ihe nodes ihai N2 dominaies Symmetric c-command Where N1 and N2 c-command each oiher 20
21 Taking a step back: Whai s ihe poini of syniaciic iheory, again? The job of syntacticians: Creaie ihe simplesi possible sei of rules for generaiing ihe grammaiical and ungrammaiical seniences in a language L. Conclusion of previous seminar: The inpui for syniaciic rules are lexemes wiih syniaciic caiegory feaiures (Ns, Vs, Ps) 21
22 Noam Chomsky (1959): We can describe a language in ierms of Phrase Structure rules 22
23 Phrase Structure rules for a fragment of English TP DP T TP DP + T T T + VP DP D + NP VP V + DP the dog will chase the cat 23
24 Phrase Structure rules for a fragment of English D TP DP T NP TP DP + T T T + VP DP D + NP VP V + DP the dog will chase the cat 24
25 Phrase Structure rules for a fragment of English TP DP T TP DP + T T T + VP DP D + NP VP V + DP D NP T VP the dog will chase the cat 25
26 Phrase Structure rules for a fragment of English TP DP T TP DP + T T T + VP DP D + NP VP V + DP D NP T VP the dog will chase the cat V DP 26
27 Phrase Structure rules for a fragment of English TP DP T TP DP + T T T + VP DP D + NP VP V + DP D NP T VP the dog will chase the cat V DP D NP 27
28 Phrase Structure rules for a fragment of English TP DP T D NP the dog T VP will V chase D the DP NP cat TP DP + T T T + VP DP D + NP VP V + DP the dog will chase the cat 28
29 Main problem with Chomsky s Phrase Structure Rules: Only make reference io ihe syniaciic caiegory of a lexeme Alihough caiegories are imporiani, ihe grammaiicaliiy of a senience is infuenced by many oiher faciors e.g. Agreemeni and argumeni siruciure 29
30 Phrase Structure rules for a fragment of English TP DP T TP DP + T T T + VP DP D + NP VP V + DP D NP T VP V DP D NP 30
31 Phrase Structure rules for a fragment of English TP DP T D NP the dog(s) T VP is V chasing D the DP NP cat TP DP + T T T + VP DP D + NP VP V + DP the dog is chasing the cat * the dogs is chasing the cat 31
32 Phrase Structure rules for a fragment of English TP DP T TP DP + T T T + VP DP D + NP VP V + DP D NP T VP V DP D NP 32
33 Phrase Structure rules for a fragment of English TP DP T D NP the door T VP will V open D the DP NP man TP DP + T T T + VP DP D + NP VP V + DP the man will open the door # the door will open the man 33
34 Phrase Structure rules for a fragment of English TP DP T D NP the man T VP will V open D the DP NP door TP DP + T T T + VP DP D + NP VP V + DP the man will open the door 34
35 Phrase Structure rules for a fragment of English TP DP T D NP the door T VP will V open D the DP NP man TP DP + T T T + VP DP D + NP VP V + DP the man will open the door # the door will open the man 35
36 Should we make Phrase Structure rules more precise? TP DPsubj + T T T[+ subj-agr] + VP DP D + NP VP V + DPobj 36
37 Noam Chomsky (1995): Syniaciic generaiion = Merge. Merge is consirained by independeni rules. 37
38 What is Merge? Merge is a simple unifcaiion mechanism Part 1: Take iwo inpuis and Merge ihem. Part 2: Give ihe resuliing group a caiegory label. Inpuis can be eiiher lexemes or ihe resuli of previous Merge The label is usually ihe caiegory of a seleciing head. In ihe case of adjunciion, ii s ihe non-adjoining phrase. 38
39 Merge in action: the[d] quickly[advp] chase[v] cat[d] will[t] the[d] dog[np] 39
40 Merge in action: chase[v] quickly[advp] will[t] the[d] dog[np] DP D the NP cat 40
41 Merge in action: quickly[advp] will[t] the[d] dog[np] VP V chase D the DP NP cat 41
42 Merge in action: will[t] the[d] VP dog[np] VP V chase D the DP NP cat AdvP quickly 42
43 Merge in action: T the[d] T will VP V chase D the VP DP NP cat AdvP quickly dog[np] 43
44 Merge in action: DP T D the NP dog T will VP V chase D the VP DP NP cat AdvP quickly 44
45 Merge in action: TP DP T D the NP dog T will VP V chase D the VP DP NP cat AdvP quickly 45
46 How should merge be constrained? By saiisfying demands iniroduced by ihe lexemes being Merged By saiisfying addiiional language-specifc rules 46
47 How should merge be constrained? By saiisfying demands iniroduced by ihe lexemes being Merged By saiisfying addiiional language-specifc rules 47
48 CATEGORY-SELECTION (also Subcategorisation) Lexemes ofien wani io Merge wiih oiher lexemes ihai have pariicular caiegorial properiies. In ihis case, lexeme A selects lexeme B. 48
49 Example: Complementisers and selection What are complementisers? Lexemes ihai iniroduce embedded clauses (1) John wonders whether Mary will arrive. (2) John wonders if Mary will arrive. (3) John ihinks (that) Mary will arrive. (4) John prefers for Mary io arrive laie. 49
50 Example: Complementisers and selection What are complementisers? Complemeniisers Merge wiih TPs (1) John wonders whether Mary will arrive. V wonders C wheiher CP TP Mary will arrive 50
51 Example: Complementisers and selection What are complementisers? Complemeniisers Merge wiih TPs (1) John wonders whether Mary will arrive. V wonders C wheiher CP TP Mary will arrive 51
52 Example: Complementisers and selection that (5a) John ihinks ihai [ Mary will arrive]. fnite TP (5b) * John ihinks ihai [ Mary to arrive]. infnitival TP if (6a) John wonders if [ Mary will arrive]. fnite TP (6b) * John wonders if [ Mary to arrive.] for (7a) * John prefers for [ Mary will arrive]. infnitival TP fnite TP (7b) John prefers for [ Mary to arrive]. infnitival TP whether (8a) John wonders wheiher [ Sue will arrive]. fnite TP (8b) John wonders wheiher [ to leave]. infnitival TP 52
53 Example: Complementisers and selection that Cat Sel C +fniie TP if (6a) John wonders if [ Mary will arrive]. fnite TP (6b) * John wonders if [ Mary to arrive.] for (7a) * John prefers for [ Mary will arrive]. infnitival TP fnite TP (7b) John prefers for [ Mary to arrive]. infnitival TP whether (8a) John wonders wheiher [ Sue will arrive]. fnite TP (8b) John wonders wheiher [ to leave]. infnitival TP 53
54 Example: Complementisers and selection that Cat Sel C +fniie TP if Cat Sel C +fniie TP for (7a) * John prefers for [ Mary will arrive]. fnite TP (7b) John prefers for [ Mary to arrive]. infnitival TP whether (8a) John wonders wheiher [ Sue will arrive]. fnite TP (8b) John wonders wheiher [ to leave]. infnitival TP 54
55 Example: Complementisers and selection that Cat Sel C +fniie TP if Cat Sel C +fniie TP for Cat Sel C -fniie TP whether (8a) John wonders wheiher [ Sue will arrive]. fnite TP (8b) John wonders wheiher [ to leave]. infnitival TP 55
56 Example: Complementisers and selection that Cat Sel C +fniie TP if Cat Sel C +fniie TP for Cat Sel C -fniie TP whether Cat Sel C ±fniie TP 56
57 The order of selection The frsi seleciee (i.e. argumeni) always Merges frsi. The frsi seleciee is ihe complement. Non-frsi seleciees are specifers. 57
58 The order of selection hope Cat Sel V {TP, CP}, DP 58
59 The order of selection hope Cat Sel V {TP, CP}, DP V V hope CP ihai Jack wins 59
60 The order of selection hope Cat Sel V {TP, CP}, DP VP DP V we V hope CP ihai Jack wins 60
61 Two important facts about selection: [1] Seleciion is local (ii deiermines whai Merges wiih whai) [2] Seleciion is ordered Does selection only work on the syntactic category of the selectee? Defniiely Noi!! open Cat Sel V DP, DP (9) The man opened the door. (10) * The door opened the man. 61
62 Θ-theory: the basics Argumenis of ceriain heads (e.g. verbs and adjeciives) have ihemaiic relaiions io ihai head. (9) The man opened the door. (10) * The door opened the man. ihe man ihe ihing doing ihe aciion ihe door ihe ihing undergoing ihe aciion agent theme open Cat V Sel DPpatient, DPagent 62
63 Θ-theory: the basics The order of argumeni-seleciion can be described in ierms of a ihemaiic heirarchy (ofien called ihe Θ-hierarchy): Ageni recipieni paiieni/iheme goal Merged last Merged frst 63
64 Θ-theory: the basics These argumeni-siruciure relaiions are ofien discussed in ierms of Θ-roles. (9) The man opened the door. Θ Θ In (9), open assigns a iheme Θ-role io the door and an Ageni Θ-role io the man. 64
65 Important points Phrase Siruciure rules are noi resiriciive enough Modern generaiive iheory: Allow unconsirained siruciure-building (Merge) Consirainis comes from lexemes and from global rules Category selection is a lexical consiraini Seleciion is local: ii deiermines ihe order of Merge Seleciion ihai refers only io caiegories isn i resiriciive enough eiiher! We need seleciion io refer io ihemaiic relaiions: = Θ-theory 65
Infnitives (revisited) / New diagnostics
Syntax II Seminar 8 Infnitives (revisited) / New diagnostics Dr. James Grifiihs james.grifiihs@uni-konsianz.de 1 Part I: Infnitives (revisited) 2 Recap: Infnitival embedded clauses (from seminar 3) (1)
More informationSyntax II. Seminar 7. Ditransitives and layered VPs. Dr. James Grifiihs.
Syntax II Seminar 7 Ditransitives and layered VPs Dr. James Grifiihs james.grifiihs@uni-konsianz.de If Merge is ihe concaienaiion of iwo ihings, ihen syniaciic irees are always binary-branching: (1) Binary
More informationX-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 informationCh. 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 informationCAS 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(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 informationAndrew 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 informationAn introduction to German Syntax. 1. Head directionality: A major source of linguistic divergence
An introduction to German Syntax 19 January 2018 1. Head directionality: A major source of linguistic divergence In English, heads uniformly precede their complements: (1) a. [ kiss Mary] a. * [ Mary kiss]
More informationParsing with Context-Free Grammars
Parsing with Context-Free Grammars Berlin Chen 2005 References: 1. Natural Language Understanding, chapter 3 (3.1~3.4, 3.6) 2. Speech and Language Processing, chapters 9, 10 NLP-Berlin Chen 1 Grammars
More informationSemantics 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 informationTHE DRAVIDIAN EXPERIENCER CONSTRUCTION AND THE ENGLISH SEEM CONSTRUCTION. K. A. Jayaseelan CIEFL, Hyderabad
THE DRAVIDIAN EXPERIENCER CONSTRUCTION AND THE ENGLISH SEEM CONSTRUCTION K. A. Jayaseelan CIEFL, Hyderabad 1. Introduction In many languages e.g. Malayalam, Tamil, Hindi, the same verb is used in the Experiencer
More informationSharpening 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 information1. 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 informationCAS 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 informationSharpening the empirical claims of generative syntax through formalization
Sharpening the empirical claims of generative syntax through formalization Tim Hunter University of Minnesota, Twin Cities NASSLLI, June 2014 Part 1: Grammars and cognitive hypotheses What is a grammar?
More informationIntroduction 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 informationHPSG: 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 informationStepanov 2007: The End of CED? Minimalism and Extraction Domains
Stepanov (2007) Stepanov 2007: The End of CED? Minimalism and Extraction Domains 1 Introduction In English (and other languages), overt wh-extraction out of subjects or adjuncts (as opposed to objects)
More informationSemantics 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 informationCAS 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 informationCS 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 informationHPSG 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 informationBARE 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 informationComputationele grammatica
Computationele grammatica Docent: Paola Monachesi Contents First Last Prev Next Contents 1 Unbounded dependency constructions (UDCs)............... 3 2 Some data...............................................
More informationNatural Language Processing : Probabilistic Context Free Grammars. Updated 5/09
Natural Language Processing : Probabilistic Context Free Grammars Updated 5/09 Motivation N-gram models and HMM Tagging only allowed us to process sentences linearly. However, even simple sentences require
More informationModels 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 informationAnother look at PSRs: Intermediate Structure. Starting X-bar theory
Another look at PSRs: Intermediate Structure Starting X-bar theory Andrew Carnie, 2006 Substitution Andrew Carnie, 2006 Substitution If a group of words can be replaced by a single word, they are a constituent.
More informationOther 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 informationQuantification: Quantifiers and the Rest of the Sentence
Ling255: Sem & Cogsci Maribel Romero February 17, 2005 Quantification: Quantifiers and the Rest of the Sentence 1. Introduction. We have seen that Determiners express a relation between two sets of individuals
More informationOn 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 informationWh-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 informationThe 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 informationOne 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 informationSpring 2017 Ling 620. An Introduction to the Semantics of Tense 1
1. Introducing Evaluation Times An Introduction to the Semantics of Tense 1 (1) Obvious, Fundamental Fact about Sentences of English The truth of some sentences (of English) depends upon the time they
More informationGrundlagenmodul Semantik All Exercises
Grundlagenmodul Semantik All Exercises Sommersemester 2014 Exercise 1 Are the following statements correct? Justify your answers in a single short sentence. 1. 11 {x x is a square number} 2. 11 {x {y y
More informationA* Search. 1 Dijkstra Shortest Path
A* Search Consider the eight puzzle. There are eight tiles numbered 1 through 8 on a 3 by three grid with nine locations so that one location is left empty. We can move by sliding a tile adjacent to the
More informationIntensionality. 1. Intensional Propositional Logic (IntPL).
Ling255: Sem and CogSci Maribel Romero April 5, 2005 1. Intensional Propositional Logic (IntPL). Intensionality Intensional PL adds some operators O to our standard PL. The crucial property of these operators
More informationNatural 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 informationSpring 2012 Ling 753 A Review of Some Key Ideas in the Semantics of Plurals. 1. Introduction: The Interpretations of Sentences Containing Plurals
A Review of Some Key Ideas in the Semantics of Plurals 1. Introduction: The Interpretations of Sentences Containing Plurals (1) Overarching Questions What are the truth-conditions of sentences containing
More informationQuantification in the predicate calculus
Quantification in the predicate calculus PHIL 43916 eptember 5, 2012 1. The problem posed by quantified sentences... 1 2. yntax of PC... 2 3. Bound and free iables... 3 4. Models and assignments... 4 5.
More informationArtificial 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 informationRecap: 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 informationConstituency. 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 informationGrammar 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 informationEntropy. Leonoor van der Beek, Department of Alfa-informatica Rijksuniversiteit Groningen. May 2005
Entropy Leonoor van der Beek, vdbeek@rug.nl Department of Alfa-informatica Rijksuniversiteit Groningen May 2005 What is entropy? Entropy is a measure of uncertainty or surprise or disorder. Entropy was
More informationCompositionality and Syntactic Structure Marcus Kracht Department of Linguistics UCLA 3125 Campbell Hall 405 Hilgard Avenue Los Angeles, CA 90095
Compositionality and Syntactic Structure Marcus Kracht Department of Linguistics UCLA 3125 Campbell Hall 405 Hilgard Avenue Los Angeles, CA 90095 1543 kracht@humnet.ucla.edu 1. The Questions ➀ Why does
More informationLing 5801: Lecture Notes 7 From Programs to Context-Free Grammars
Ling 5801: Lecture otes 7 From Programs to Context-Free rammars 1. The rules we used to define programs make up a context-free grammar A Context-Free rammar is a tuple C,X,S,R, where: C is a finite set
More informationHarvard CS 121 and CSCI E-207 Lecture 9: Regular Languages Wrap-Up, Context-Free Grammars
Harvard CS 121 and CSCI E-207 Lecture 9: Regular Languages Wrap-Up, Context-Free Grammars Salil Vadhan October 2, 2012 Reading: Sipser, 2.1 (except Chomsky Normal Form). Algorithmic questions about regular
More informationSyntactic Theory 2 Week 5: Merge and Linearization
Syntactic Theory 2 Week 5: Merge and Linearization Dustin A. Chacón February 7, 2017 1 Introduction In GB, D-Structure was the representation where: phrase structure is assembled in accordance with X -theory,
More informationSome binding facts. Binding in HPSG. The three basic principles. Binding theory of Chomsky
Some binding facts Binding in HPSG Binding theory has to do with constraining referentially dependent elements in terms of what is a possible antecedent, or binder. Introduction to HPSG June, 009 (1) John
More informationLing 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 informationSemantics 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 informationSemantics 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 information2013 ISSN: JATLaC Journal 8: t 1. t t Chomsky 1993 I Radford (2009) R I t t R I 2. t R t (1) (= R's (15), p. 86) He could have helped
t 1. tt Chomsky 1993 IRadford (2009) R Itt R I 2. t R t (1) (= R's (15), p. 86) He could have helped her, or [she have helped him]. 2 have I has had I I could ellipsis I gapping R (2) (= R (18), p.88)
More informationCategories and Transformations 321
Categories and ransformations 321 4.10 Functional Categories and Formal Features What precedes substantially revises the framework developed in chapters 1 3. But we have not yet subjected functional categories
More informationFeature Stacks and Binding Relations
Feature Stacks and Binding Relations Silke Fischer (Universität Stuttgart) The Fine Structure of Grammatical Relations, Universität Leipzig December 10, 2010 1. Introduction Background: In Fischer (2004b,
More informationCAS 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 informationa. Develop a fragment of English that contains quantificational NPs. b. Develop a translation base from that fragment to Politics+λ
An Algebraic Approach to Quantification and Lambda Abstraction: Applications to the Analysis of English (1) Ingredients on the Table a. A logical language with both quantification and lambda abstraction
More informationModel-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 informationAspects of Tree-Based Statistical Machine Translation
Aspects of Tree-Based Statistical Machine Translation Marcello Federico Human Language Technology FBK 2014 Outline Tree-based translation models: Synchronous context free grammars Hierarchical phrase-based
More informationMultiword Expression Identification with Tree Substitution Grammars
Multiword Expression Identification with Tree Substitution Grammars Spence Green, Marie-Catherine de Marneffe, John Bauer, and Christopher D. Manning Stanford University EMNLP 2011 Main Idea Use syntactic
More informationRaising 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 informationDecoding 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 informationStructures mathématiques du langage
tructures mathématiques du langage Alain Lecomte 16 février 2014 1 Heim and Kratzer s theory Montague s grammar was conceived and built during the sixties of the last century, without much attention paid
More informationParsing 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 informationLinearization. {α,β}= 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 informationUnterspezifikation in der Semantik Scope Semantics in Lexicalized Tree Adjoining Grammars
in der emantik cope emantics in Lexicalized Tree Adjoining Grammars Laura Heinrich-Heine-Universität Düsseldorf Wintersemester 2011/2012 LTAG: The Formalism (1) Tree Adjoining Grammars (TAG): Tree-rewriting
More informationThe 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 informationSpring 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 informationWeek 6: The VP Domain I - The Event and vp Seminar: The Syntax-Semantics Interface M. Louie February Introduction
Week 6: The Domain - The Event and vp Seminar: The Syntax-Semantics nterface M. Louie February 2017 1 ntroduction Last Week: The Mass/Count Distinction We briefly mentioned Borer 2005 s notion of (non-)quantity
More informationLECTURER: BURCU CAN Spring
LECTURER: BURCU CAN 2017-2018 Spring Regular Language Hidden Markov Model (HMM) Context Free Language Context Sensitive Language Probabilistic Context Free Grammar (PCFG) Unrestricted Language PCFGs can
More informationComputational Linguistics
Computational Linguistics Dependency-based Parsing Clayton Greenberg Stefan Thater FR 4.7 Allgemeine Linguistik (Computerlinguistik) Universität des Saarlandes Summer 2016 Acknowledgements These slides
More informationA 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 informationComputational Linguistics. Acknowledgements. Phrase-Structure Trees. Dependency-based Parsing
Computational Linguistics Dependency-based Parsing Dietrich Klakow & Stefan Thater FR 4.7 Allgemeine Linguistik (Computerlinguistik) Universität des Saarlandes Summer 2013 Acknowledgements These slides
More informationCS 188 Introduction to AI Fall 2005 Stuart Russell Final
NAME: SID#: Section: 1 CS 188 Introduction to AI all 2005 Stuart Russell inal You have 2 hours and 50 minutes. he exam is open-book, open-notes. 100 points total. Panic not. Mark your answers ON HE EXAM
More informationGovernment, Agreement and Minimality Ian Roberts Downing College, University of Cambridge
1. Introduction 1 Government, Agreement and Minimality Ian Roberts Downing College, University of Cambridge (igr20@cam.ac.uk) Three points: How to define government in bare phrase stcture Government reduces
More informationMoreno 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 information1 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 informationParsing. 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 informationCAS LX 522 Syntax I. We give trees to ditransitives. We give trees to ditransitives. We give trees to ditransitives. Problems continue UTAH (4.3-4.
7 CAS LX 522 Syntax I UTAH (4.3-4.4) You may recall our discussion of θ-theory, where we triumphantly classified erbs as coming in (at least) three types: Intransitie (1 θ-role) Transitie (2 θ-roles) Ditransitie
More informationCS460/626 : Natural Language Processing/Speech, NLP and the Web
CS460/626 : Natural Language Processing/Speech, NLP and the Web Lecture 23: Binding Theory Pushpak Bhattacharyya CSE Dept., IIT Bombay 8 th Oct, 2012 Parsing Problem Semantics Part of Speech Tagging NLP
More informationSentence Planning 2: Aggregation
Pipelined Microplanning Sentence Planning 2: Aggregation Lecture 10 February 28, 2012 Reading: Chapter 5, Reiter and Dale Document Plan! Lexical choice! PPSs Aggregation PPSs Referring Expression Gen!
More informationSimpler Syntax. Ling : Sign-Based Construction Grammar Instructor: Ivan A. Sag URL:
Simpler Syntax Ling 7800-065: Sign-Based Construction Grammar Instructor: Ivan A. Sag (sag@stanford.edu) URL: http://lingo.stanford.edu/sag/li11-sbcg 1/ 58 Constructs ] [mtr sign construct : dtrs nelist(sign)
More informationUnification Grammars and Off-Line Parsability. Efrat Jaeger
Unification Grammars and Off-Line Parsability Efrat Jaeger October 1, 2002 Unification Grammars and Off-Line Parsability Research Thesis Submitted in partial fulfillment of the requirements for the degree
More informationSemantics and Generative Grammar. Quantificational DPs, Part 2: Quantificational DPs in Non-Subject Position and Pronominal Binding 1
Quantificational DPs, Part 2: Quantificational DPs in Non-Subject Position and Pronominal Binding 1 1. Introduction (1) Our Current System a. The Ds no, some, and every are type (Quantificational
More informationUniformity 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 informationIntroduction 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 informationDenotation of Predicates
Denotation of Predicates Assume a world w 5, where D = {Ann, Betty, Connor}, Betty and Connor are smokers, but Ann isn t. Set notation [[smoke]] w 5 = {Betty, Connor} = {x : x smokes in w 5 } Functional
More informationMaschinelle Sprachverarbeitung
Maschinelle Sprachverarbeitung Parsing with Probabilistic Context-Free Grammar Ulf Leser Content of this Lecture Phrase-Structure Parse Trees Probabilistic Context-Free Grammars Parsing with PCFG Other
More informationMaschinelle Sprachverarbeitung
Maschinelle Sprachverarbeitung Parsing with Probabilistic Context-Free Grammar Ulf Leser Content of this Lecture Phrase-Structure Parse Trees Probabilistic Context-Free Grammars Parsing with PCFG Other
More informationSemantics and Generative Grammar. Expanding Our Formalism, Part 1 1
Expanding Our Formalism, Part 1 1 1. Review of Our System Thus Far Thus far, we ve built a system that can interpret a very narrow range of English structures: sentences whose subjects are proper names,
More informationTree Adjoining Grammars
Tree Adjoining Grammars Feature Structure Based TAG Laura Kallmeyer & Benjamin Burkhardt HHU Düsseldorf WS 2017/2018 1 / 20 Outline 1 Why feature structures? 2 Basics of feature structure logic 3 Feature
More informationA Study of Entanglement in a Categorical Framework of Natural Language
A Study of Entanglement in a Categorical Framework of Natural Language Dimitri Kartsaklis 1 Mehrnoosh Sadrzadeh 2 1 Department of Computer Science University of Oxford 2 School of Electronic Engineering
More informationCMPT-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 informationSTRUCTURAL NON-CORRESPONDENCE IN TRANSLATION
STRUCTURAL NON-CORRESPONDENCE IN TRANSLATION Louisa Sadler, Dept. of Language and Linguistics, University of Essex, Wivenhoe Park, Colchester, CO4 3SQ, Essex, UK. louisa@uk.ac.essex Henry S. Thompson,
More informationContext Free Grammars
Automata and Formal Languages Context Free Grammars Sipser pages 101-111 Lecture 11 Tim Sheard 1 Formal Languages 1. Context free languages provide a convenient notation for recursive description of languages.
More informationCS460/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 informationProseminar on Semantic Theory Fall 2013 Ling 720 Propositional Logic: Syntax and Natural Deduction 1
Propositional Logic: Syntax and Natural Deduction 1 The Plot That Will Unfold I want to provide some key historical and intellectual context to the model theoretic approach to natural language semantics,
More informationMovement-Generalized Minimalist Grammars
Movet-Generalized Minimalist Grammars Thomas Graf tgraf@ucla.edu tgraf.bol.ucla.edu University of California, Los Angeles LACL 2012 July 2, 2012 Outline 1 Monadic Second-Order Logic (MSO) Talking About
More informationModular Grammar Design with Typed Parametric Principles
1 Modular Grammar Design with Typed Parametric Principles 1.1 Introduction Extensible Dependency Grammar (xdg) (Debusmann et al., 2004) is a general framework for dependency grammar, with multiple levels
More information