Simpler Syntax. Ling : Sign-Based Construction Grammar Instructor: Ivan A. Sag URL:
|
|
- Millicent Evans
- 6 years ago
- Views:
Transcription
1 Simpler Syntax Ling : Sign-Based Construction Grammar Instructor: Ivan A. Sag URL: 1/ 58
2 Constructs ] [mtr sign construct : dtrs nelist(sign) The mother(mtr) feature is used to place constraints on the set of signs that are licensed by a given construct. The feature daughters(dtrs) specifies information about the one or more signs that contribute to the analysis of a construct s mother; the value of dtrsis a nonempty list of signs. 2/ 58
3 The cat and val values of lexical signs are packed with information. The complexity of this information is managed by the organization of lexical types and the lexical class constructions. Once these s are so empowered, the properties of clauses are ensured by simple constraints on phrasal constructs. 3/ 58
4 Three Phrasal Constructions Predicative Head-Complement Construction ( hd-cxt): pred-hd-comp-cxt mtr [syn X! [val Y ]] dtrs cat [xarg Y] syn X : L :nelist val Y L Subject-Predicate Construction ( subj-hd-cxt): subj-pred-cl mtr [syn Y! [val ] ] vf fin cat dtrs X, syn Y : aux mrkg unmk val X 4/ 58
5 Three Phrasal Constructions Headed Construction ( phrasal-cxt): headed-cxt [ ] mtr [syn [cat Y ]] hd-dtr [syn [cat Y ]] 5/ 58
6 Some Types of Phrasal Construct (Ginzburg/Sag 2000) linguistic-object... construct phrasal-cxt headed-cxt clause... head-comp-cxt subj-head-cxt... core-cl pred-hd-comp-cxt... subj-pred-cl declarative-cl... 6/ 58
7 The Sign Principle: Every sign must be listemically or constructionally licensed, where: a. a sign is listemically licensed only if it satisfies some listeme, and b. a sign is constructionally licensed only if it is the mother of some well-formed construct. 7/ 58
8 pred-hd-comp-cxt form loves, them syn cat 3 verb vf fin aux xarg 1NP select none val 1 form loves syn cat 3 verb vf fin aux xarg NP select none val 1, 2 2 form them syn cat noun case acc... 8/ 58
9 subj-pred-cl form Obama, loved, them syn cat 2 verb vf fin aux xarg NP select none 1 form Obama syn cat noun case nom... form loved, them syn cat 2 verb vf fin aux xarg NP select none val 1 9/ 58
10 An Analysis Tre 1 form Obama, loved, them cat 2 syn val form Obama syn NP form loved, them cat 2 syn val 1 form loved cat 2 syn val 1, 2 form them syn NP 2 10/ 58
11 Historical Note: Feature Decomposition of Grammatical Categories As early as the mid 1960s, Chomsky had suggested replacing familiar syntactic categories (S, NP, VP, P) with feature bundles, e.g. [ +V N ], [ +N V ], [ +V N ], [ N V V + N + V + N N, V, N, V BAR 2 BAR 2 BAR 1 BAR 0 Widely adopted in TG and elsewhere. ] 11/ 58
12 Feature Decomposition of Grammatical Categories 2 X-Theory Head Feature Principle: The category of a mother is the same as the category of the head daughter. Widely adopted in TG and elsewhere. 12/ 58
13 v + n bar 2 (=S) v n + bar 2 v + n bar 1 (=VP) two guys v + n bar 0 walked v n (=PP) bar 1 v v n n + bar 0 bar 2 (=NP) into a bar 13/ 58
14 form gave, a, watch, to, Pat verb syn cat vf fin val NP form gave form to, Pat verb syn cat form a, watch vf fin prep syn NP cat syn pf to val NP,NP,PP[to] val form to prep syn cat form Pat pf to syn NP val NP 14/ 58
15 Issues of ( Core ) Clausal Syntax Dummies/Expletives (it and there) Raising (NP-Movement) Control (of PRO) Obligatory Binding (of reflexives and reciprocals) [ Principle A effects] Obviation ( Principle B ) Effects 15/ 58
16 Uses of Dummy It Meteorological Temporal It-Clefts It-Extraposition Idiomatic uses Never appears in a referential position 16/ 58
17 Types of Indices index ref-index it there indv-index sit-index [ ] arg-st NP ref, NP ref, NP ref 17/ 58
18 Lexemes Selecting Dummy-It as an Argument ] [syn [cat [lid meteo-fr]] meteo-lxm arg-st NP it meteo-lxm form rain [ ] cat [lid rain-fr] syn val NP it arg-st NP it form be cat [vf fin] arg-st NP it, 1XP, syn val gap 1 18/ 58
19 An Analysis Tree 1 form it, rained cat 2 syn val form it syn NP it form rained cat 2 syn val 1 19/ 58
20 1 form it, was, justice, I wanted cat 2 syn val form it syn NP it form was cat 2 syn val 1, 3, 4 form was, justice, I, wanted cat 2 syn val 1 form justice syn NP sem... 3 form I, wanted syn S[gap 3 ] sem / 58
21 It-Extraposition [ ] form bother arg-st [val ] ref, NP ref Kim/That I lost/going home... bothers me. Lexical-class construction for semantically related verbal lexemes: bother, annoy, please, trouble, unsettle, rattle,... It bothers me That I lost/*kim/*going home. [ ] it-extra-cxt mtr arg-st NP it L dtrs [arg-st L [syn[catverbal]],... ] [ ] form bother arg-st NP it, NP, S/CP 21/ 58
22 form it, bothered, me, that, he, won cat 2 syn val form it syn NP it 1 form bothered cat 2 syn val 1, 3, 4 form bothered, me, that, he, won cat 2 syn val 1 form me syn NP sem... 3 form that, he, won syn S sem / 58
23 Lexical Exceptions It seems/appears (to me) that Sandy won the race. *That Sandy won the race seems/appears (to me). form seem cat [vf fin] arg-st NP it, (PP[to],) syn val No exceptions the other way, suggesting derivational construction of extraposition I take it it /*Kim/*there (that) you agree. form take cat [vf fin] arg-st NP i, NP it, syn val 23/ 58
24 Uses of Dummy There Simple existence Nonnominal predication Uses with coming-into-existence verbs Idiomatic uses 24/ 58
25 There-Selecting Lexemes [ ] form be arg-st NP there,α, NP, XP α [pred +] There is someone sick/on the phone/smiling/affected by the decision. *There is someone an invalid. There be/exist/stand/hang/occur Presentational There: There jumped out from the bush a small, furry animal. run/walk/roll/... (verbs of motion) Lexical variation, organized in part by lexical class. Lexical idiosyncrasy: There exists a Santa Claus./A Santa Claus exists. There is a Santa Claus./*A Santa Claus is. 25/ 58
26 1 form there, is, a, spider, on, me cat 2 syn val form there syn NP there,sg form is cat 2 syn val 1, 3, 4 form is, a, spider, on, me cat 2 syn val 1 form a, spider syn NP sg [pred +] sem... 3 form on, me syn PP[loc] sem / 58
27 Locality Problem 4: English Copy Raising (Rogers 1974, Potsdam and Runner 2001, Asudeh 2002) there s going to be a storm There looks like *it s going to rain *Kim s going to win. there s going to be a storm Sandy looks like it s going to rain Kim s going to win. 27/ 58
28 External Argument (xarg) form looks [ S ] arg-st NP i, mrkg like xarg pro i [ ] form looks arg-st NP i, S[mrkg like] 28/ 58
29 Subject Raising Lexemes Continue The temperature continued to climb. It continued to rain. There continued to be clouds in the sky. Likely The temperature is likely to climb. It is likely to rain. There are likely to be clouds in the sky. seem, appear, unlikely, apt, be, auxiliaries,... Lexical classes with idiosyncrasies, e.g. *probable, *improbable 29/ 58
30 Subject Raising Lexemes sraising-v-lxm form continue arg-st X, VP[inf] [val X ] form be [ XP ] arg-st Y, cat [pred +] val Y sraising-a-lxm form likely arg-st X, VP[inf] [val X ] 30/ 58
31 Cross-Categorial Lexeme Types lexeme... adj-lexeme sraising-lxm sraising-a-lxm sraising-lxm [ arg-st X, ] XP [val X ],... 31/ 58
32 form seems, to, like, Boulder syn val 1 NP ref form seems syn val 1 form to, like, Boulder syn val 1 form to syn val 1 form like, Boulder syn val 1 32/ 58
33 form seem, to, be, clouds, in, the, sky [ ] syn val 1 NP there,pl form seem syn val 1 form to, be, clouds, in, the, sky syn val 1 form to syn val 1 form be, clouds, in, the, sky [ ] syn val 1 NP there,pl 33/ 58
34 Long-Distance Agreement in Raising Structures They seem/*seems to like Boulder. There seems/*seem to be [a difference of opinion]. There is/*are likely to be [a difference of opinion]. 3rd Singular Present Indicative Verb Forms are specified as: [arg-st NP sg,... ] %There s likely to be [differences of opinion]. %There seems to be [differences of opinion]. 34/ 58
35 Syntax-Semantics Interface Expletive-selecting lexemes have one arg-st element (the expletive) that is not assigned any semantic role in the lexeme s semantics. Subject-raising lexemes have one arg-st element (the raised subject) that is not assigned any semantic role in the lexeme s semantics. This is all that needs to be said in order to induce the mismatch between the number of syntactic and semantic arguments. 35/ 58
36 Object Raising Lexemes believe We believed the temperature to be climbing. We believed it to be raining. We believed there to be clouds in the sky. believe, consider, prove,... Lexical class with idiosyncrasies 36/ 58
37 Object Raising Lexemes oraising-v-lxm form believe [ VP[inf] ] arg-st NP, Y, val Y 37/ 58
38 form believe, there, to, be, clouds, in, the, sky syn val 2 form believe syn val 2, 1, 0 form there syn NP there,pl 1 0 form to, be, clouds, in, the, sky syn val 1 form to syn val 1,4 form be, clouds,. [ syn val 1 NP ther 4 38/ 58
39 Syntax-Semantics Interface Object-raising lexemes have one arg-st element (the raised object) that is not assigned any semantic role in the lexeme s semantics. This is all that needs to be said in order to induce the mismatch between the number of syntactic and semantic arguments. 39/ 58
40 Subject Control Lexemes Try Sandy tried to climb a mountain. *It tried to be 94 degrees out *There tried to be clouds in the sky. eager Sandy is eager to climb a mountain. *It is eager to be 94 degrees out. *There are eager to be clouds in the sky. try, attempt, want, hope, desire, promise, vow,... eager, anxious,... 40/ 58
41 Subject Control Lexemes scontrol-v-lxm form try arg-st NP i, VP[inf] [val NP i ] scontrol-a-lxm form eager arg-st NP i, VP[inf] [val NP i ] 41/ 58
42 form tried, to, like, Boulder syn val 1 NP i form tried syn val 1,2 form to, like, Boulder syn val 3 NP i 2 form to syn val 3, 4 form like, Boulder syn val / 58
43 Object Control Lexemes persuade Sandy persuaded them to climb a mountain. *Sandy persuaded it to be 94 degrees out. *Sandy persuaded there to be clouds in the sky. ocontrol-v-lxm form persuade arg-st NP j, NP i, VP[inf] [val NP i ] persuade, dissuade, convince, force, invite, appeal (to),... 43/ 58
44 form persuaded syn val 1,2,3 form persuaded, us, to, like, Boulder syn val 1 NP form us syn NP i 2 form to, like, Boulder syn val 4 NP i 3 form to syn val 4, 5 form like, Boulder syn val / 58
45 Locality Problem 3: Prevent From Kim prevented Pat [from reading Proust]. **Kim prevented Pat [for/to... reading Proust]. **Kim prevented Pat [from (to) read Proust]. **Kim prevented Pat [from the Proust recital]. This prevent is a raising verb: She prevented there from being a riot in the square. The high pressure concentration to the north prevented it from raining on our party. 45/ 58
46 The Solution to the Prevent From Problem In American English, from functions as a marker (not a head) when it cooccurs with prevent. v. Van Eynde 2007 on head-functor s, using select. cf. also Abeillé, Bonami, Godard, and Tseng 2005, 2006 on weak heads in French. Predicts: What did you prevent them from *?(doing)? 46/ 58
47 Some marking Values (bis) marking unmk than as of det a def the most general marking value - a supertype of the rest s that aren t marked, e.g. we read compared s, e.g. than we read equated s, e.g. as I could some of-s, e.g. of mine determined nominal signs (see below) a subtype of det, e.g. a book definite nominal signs, i.e. the table, Prince, we 47/ 58
48 Head-Functor Construction: hd-func-cxt mtr [syn X! [mrkg M ]] ] cat [select Y ] dtrs syn[, Y :[syn X] mrkg M 48/ 58
49 hd-func-cxt form a, puppy syn cat 3 [ noun select none ] val L mrkg 2a form a syn cat [ det select 1 ] mrkg 2a 1 form puppy syn cat 3 [ noun select none ] val L mrkg unmk 49/ 58
50 hd-func-cxt form happy, puppy syn cat 3 [ noun select none ] val L mrkg 2unmk form happy syn cat [ adj select 1 ] mrkg 2unmk 1 form puppy syn cat 3 [ noun select none ] val L mrkg unmk 50/ 58
51 form from, doing, that verb cat syn vf ger mrkg from val 1NP form from syn cat prep select 2 mrkg from form doing, that [ verb cat syn vf mrkg unm val 1 2 ] ger 51/ 58
52 form from syn cat prep mrkg from select VP[ger] val form prevent syn cat verb val NP, X, VP [ mrkg from val X ] 52/ 58
53 Some Idiosyncrasies grow, get, end up, become, turn out, wax consider, regard, rate, count allow, permit 53/ 58
54 Passive passive-cxt mtr dtrs form F pastp (Y ) syn X :[cat [vf pas]] arg-st L (PP[by] i ) trans-v-lxm form Y syn X arg-st NP i L 54/ 58
55 Some Active/Passive arg-st Correspondences Active: [arg-st NP i, NP j ] hit, like,... [arg-st NP i, NP j, NP ] give, tell,... [arg-st NP i, NP j, PP ] put, place,... [arg-st NP i, X, VP[val X ] ] believe, consider, prove,... [arg-st NP i, NP j, VP[val NP i ] ] persuade, force, invite,... Passive: [arg-st NP j (, PP[by] i ) ] hit, like,... [arg-st NP j, NP (, PP[by] i ) ] give, tell,... [arg-st NP j, PP (, PP[by] i ) ] put, place,... [arg-st X, VP[val X ] (, PP[by] i ) ] believe, consider, prove, [arg-st NP j, VP[val NP i ] (, PP[by] i ) ] persuade, force, invite, 55/ 58
56 form believed, to, like, Boulder syn val 1NP ref form believed syn val 1 form to, like, Boulder syn val 1 form to syn val 1 form like, Boulder syn val 1 56/ 58
57 Transmitting Dependencies Through Passivized Structures Kim ref was believed to [like Boulder]. There there was believed to [be a riot in Tripoli]. It it was believed to be [raining] in Tripoli. It it was believed to be [obvious that the answer was 2 ]. Kim ref was persuaded to [like Boulder]. *There there was persuaded to [be a riot in Tripoli]. *It it was persuaded to be [raining] in Tripoli. *It it was persuaded to be [obvious that the answer was 2 ]. There were/*was believed to [be three solutions to this problem]. 57/ 58
58 Passive Irregularity Kim was alleged to be 111 years old. *They alleged Kim to be 11 years old. alleged has a listeme; not derived by passivization. The book cost twenty dollars *Twenty dollars were cost by the book. cost is not a transitive verb lexeme. Same for weigh, symmetric predicates (e.g. resemble, equal), etc. Tuesday found us in Rome *We were found in Rome by Tuesday. Temporal, Locative advancements are derivational constructions that give rise to nontransitive verb lexemes. 58/ 58
Computationele grammatica
Computationele grammatica Docent: Paola Monachesi Contents First Last Prev Next Contents 1 Unbounded dependency constructions (UDCs)............... 3 2 Some data...............................................
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 informationControl 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 informationControl 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 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 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 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 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 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 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 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 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 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 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 informationUnification. Two Routes to Deep Structure. Unification. Unification Grammar. Martin Kay. Stanford University University of the Saarland
Two Routes to Deep Structure Derivational! Transformational! Procedural Deep Unidirectional Transformations Surface Stanford University University of the Saarland Constraint-based! Declarative Deep Surface
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 informationParsing 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 informationParsing 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 informationDependency 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 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 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 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 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 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 informationAnalyzing 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 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 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 informationCHAPTER THREE: RELATIONS AND FUNCTIONS
CHAPTER THREE: RELATIONS AND FUNCTIONS 1 Relations Intuitively, a relation is the sort of thing that either does or does not hold between certain things, e.g. the love relation holds between Kim and Sandy
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 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 informationTree-Adjoining Grammars for Optimality Theory Syntax
Tree-Adjoining Grammars for Optimality Theory Syntax Virginia Savova Department of Cognitive Science Johns Hopkins University savova@jhu.edu Robert Frank Department of Cognitive Science Johns Hopkins University
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 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 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 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 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 informationTime Zones - KET Grammar
Inventory of grammatical areas Verbs Regular and irregular forms Pages 104-105 (Unit 1 Modals can (ability; requests; permission) could (ability; polite requests) Page 3 (Getting Started) Pages 45-47,
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 informationThe SUBTLE NL Parsing Pipeline: A Complete Parser for English Mitch Marcus University of Pennsylvania
The SUBTLE NL Parsing Pipeline: A Complete Parser for English Mitch Marcus University of Pennsylvania 1 PICTURE OF ANALYSIS PIPELINE Tokenize Maximum Entropy POS tagger MXPOST Ratnaparkhi Core Parser Collins
More informationThai Wh-expressions at the Left Edge of the Clause: Contrastive and Identificational Wh-clefts
Concentric: Studies in Linguistics 33.2 (July 2007): 121-157 Thai Wh-expressions at the Left Edge of the Clause: Contrastive and Identificational Wh-clefts Sugunya Ruangjaroon Srinakharinwirot University
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 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 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 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 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 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 informationLogical 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 informationParsing with Context-Free Grammars
Parsing with Context-Free Grammars CS 585, Fall 2017 Introduction to Natural Language Processing http://people.cs.umass.edu/~brenocon/inlp2017 Brendan O Connor College of Information and Computer Sciences
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 informationGeneralized Quantifiers & Categorial Approaches & Intensionality
LING 147. Semantics of Questions Week 2 Yimei Xiang September 8, 2016 Last week Generalized Quantifiers & Categorial Approaches & Intensionality The semantics of questions is hard to characterize directly.
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 informationProseminar on Semantic Theory Fall 2013 Ling 720 The Proper Treatment of Quantification in Ordinary English, Part 1: The Fragment of English
The Proper Treatment of Quantification in Ordinary English, Part 1: The Fragment of English We will now explore the analysis of English that Montague puts forth in his seminal paper, PTQ. As we ve already
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 informationTopics in Lexical-Functional Grammar. Ronald M. Kaplan and Mary Dalrymple. Xerox PARC. August 1995
Projections and Semantic Interpretation Topics in Lexical-Functional Grammar Ronald M. Kaplan and Mary Dalrymple Xerox PARC August 199 Kaplan and Dalrymple, ESSLLI 9, Barcelona 1 Constituent structure
More informationMinimal Recursion Semantics: an Introduction
Minimal Recursion Semantics: an Introduction (Mexico City 2000) Ann Copestake Daniel Flickinger Carl Pollard Ivan A. Sag 1/ 31 Desiderata for Computational Semantics: Expressive Adequacy: The framework
More information2 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 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 informationLinguistics 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 informationRemembering subresults (Part I): Well-formed substring tables
Remembering subresults (Part I): Well-formed substring tables Detmar Meurers: Intro to Computational Linguistics I OSU, LING 684.01, 1. February 2005 Problem: Inefficiency of recomputing subresults Two
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 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 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 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 informationHOUGHTON MIFFLIN HARCOURT
HOUGHTON MIFFLIN HARCOURT retold by Pleasant DeSpain illustrated by Capucine Mazille Copyright by Houghton Mifflin Harcourt Publishing Company All rights reserved. No part of this work may be reproduced
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 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 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 informationDEGREE QUANTIFIERS, POSITION OF MERGER EFFECTS WITH THEIR RESTRICTORS, AND CONSERVATIVITY
DEGREE QUANTIFIERS, POSITION OF MERGER EFFECTS WITH THEIR RESTRICTORS, AND CONSERVATIVITY RAJESH BHATT AND ROUMYANA PANCHEVA University of Texas, Austin bhatt@cs.utexas.edu University of Southern California
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 informationWhat is a natural syntactic model for frame-semantic composition?
What is a natural syntactic model for frame-semantic composition? Timm Lichte, Laura Kallmeyer & Rainer Osswald University of Düsseldorf, Germany CTF14, August 26, 214 SFB 991 1 / 26 Overview natural syntax
More informationProseminar on Semantic Theory Fall 2015 Ling 720 Adnominal Tenses Redux: Thomas (2014) Nominal Tense and Temporal Implicatures
Adnominal Tenses Redux: Thomas (2014) Nominal Tense and Temporal Implicatures 1. Tense and Nominal Tense in Mbya: A Challenge for Tonhauser (2007) Mbya is a Guarani language of Brazil, Argentina, and Paraguay.
More informationClass Notes: Tsujimura (2007), Ch. 5. Syntax (1), pp (3) a. [[akai hon]-no hyooshi] b. [akai [hon-no hyooshi]]
Class otes: Tsujimura (2007), Ch. 5. yntax (1), pp. 206-220 p. 206 What is!ytx"?! n area in linguistics that deals with the REGULRLITY of how words are put together to create grammatical sentences What
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 informationSpring 2017 Ling 620. The Semantics of Modals, Part 2: The Modal Base 1
1. On Our Last Episode The Semantics of Modals, Part 2: The Modal Base 1 (1) The Failure of a Lexical Ambiguity Account Postulating separate lexical entries for all the different readings of a modal misses
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 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 information4. Suppose that we roll two die and let X be equal to the maximum of the two rolls. Find P (X {1, 3, 5}) and draw the PMF for X.
Math 10B with Professor Stankova Worksheet, Midterm #2; Wednesday, 3/21/2018 GSI name: Roy Zhao 1 Problems 1.1 Bayes Theorem 1. Suppose a test is 99% accurate and 1% of people have a disease. What is the
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 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 informationScope Ambiguities through the Mirror
Scope Ambiguities through the Mirror Raffaella Bernardi In this paper we look at the interpretation of Quantifier Phrases from the perspective of Symmetric Categorial Grammar. We show how the apparent
More informationPredicates, Quantifiers and Nested Quantifiers
Predicates, Quantifiers and Nested Quantifiers Predicates Recall the example of a non-proposition in our first presentation: 2x=1. Let us call this expression P(x). P(x) is not a proposition because x
More informationLogic Background (1A) Young W. Lim 5/14/18
Young W. Lim Copyright (c) 2014 2018 Young W. Lim. Permission is granted to copy, distribute and/or modify this document under the terms of the GNU Free Documentation License, Version 1.2 or any later
More informationReview. Earley Algorithm Chapter Left Recursion. Left-Recursion. Rule Ordering. Rule Ordering
Review Earley Algorithm Chapter 13.4 Lecture #9 October 2009 Top-Down vs. Bottom-Up Parsers Both generate too many useless trees Combine the two to avoid over-generation: Top-Down Parsing with Bottom-Up
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 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 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 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 informationC SC 620 Advanced Topics in Natural Language Processing. Lecture 21 4/13
C SC 620 Advanced Topics in Natural Language Processing Lecture 21 4/13 Reading List Readings in Machine Translation, Eds. Nirenburg, S. et al. MIT Press 2003. 19. Montague Grammar and Machine Translation.
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 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 informationBringing machine learning & compositional semantics together: central concepts
Bringing machine learning & compositional semantics together: central concepts https://githubcom/cgpotts/annualreview-complearning Chris Potts Stanford Linguistics CS 244U: Natural language understanding
More informationFrom Kalaallisut to English:! Analysis in CCG+UC 2"
Plan for today" From Kalaallisut to English:! Analysis in CCG+UC 2" Maria Bittner " (W2: Aug 5, 2009)" Introduction: "! syn-sem traits: English SA.SU.S vs. Kalaallisut BA.TO.L"! scope corollary" UC 1 +
More informationBeliefs Mini-Story Text
Beliefs Mini-Story Text Hello, this is AJ Hoge, and this is the mini story for Beliefs. Are you feeling good? Good posture? Deep breathing? Big smile? Moving? I hope so. I m not going to start this story
More informationLogic Background (1A) Young W. Lim 12/14/15
Young W. Lim 12/14/15 Copyright (c) 2014-2015 Young W. Lim. Permission is granted to copy, distribute and/or modify this document under the terms of the GNU Free Documentation License, Version 1.2 or any
More informationBinding 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 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 informationcis32-ai lecture # 18 mon-3-apr-2006
cis32-ai lecture # 18 mon-3-apr-2006 today s topics: propositional logic cis32-spring2006-sklar-lec18 1 Introduction Weak (search-based) problem-solving does not scale to real problems. To succeed, problem
More informationLing 98a: The Meaning of Negation (Week 5)
Yimei Xiang yxiang@fas.harvard.edu 15 October 2013 1 Review Negation in propositional logic, oppositions, term logic of Aristotle Presuppositions Projection and accommodation Three-valued logic External/internal
More informationIdioms and Compositionality
Idioms and Compositionality Dag Westerståhl March 31, 1999 Abstract A standard view is that idioms present problems for compositionality. The question of compositionality, however, should be posed for
More informationON THE LOGIC OF VERBAL MODIFICATION DAVID BEAVER AND CLEO CONDORAVDI
ON THE LOGIC OF VERBAL ODIFICATION DAVID BEAVER AND CLEO CONDORAVDI Department of Linguistics University of Texas at Austin dib@mail.utexas.edu PARC and Department of Linguistics Stanford University condorav@csli.stanford.edu
More information