Topics in LFG: Issues in NP Coordination. Louisa 4.332
|
|
- Britton Singleton
- 6 years ago
- Views:
Transcription
1 Topics in LFG: Issues in NP Coordination Louisa
2 Resolution Person Resolution (1) José José y and yo I José and I speak hablamos speak.1pl 2
3 (2) PERS 1 NUM PL CONJ AND PRED PRO PERS 3 NUM SING PRED PRO PERS 1 NUM SING 3
4 The agreement features are non-distributive features. The process of feature resolution determines what the features associated with the coordinate structure as a whole are (Corbett, 1983, 1991, 1988). For example, for languages like English, Spanish, Slovak: 4
5 (3) (4) conjuncts resolve to 1 and and and and 3 3 {S,H}: 1st person {H}: 2nd person {}: 3rd person 5
6 (5) NP NP + Conj NP ( PER) ( PER) ( PER) ( PER) (6) x y is the smallest set z such that x z y z (7) hablamos: ( SUBJ PERS) = c {S,H} hablan: ( SUBJ PERS) = c {} 6
7 Gender Resolution Languages differ in the patterns of gender resolution, parly related to the fact that syntactic gender may not reflect natural gender. Marker sets for gender might be quite syntactic in nature. (8) a) a coordinate phrase behaves as though it had the same gender as some noncoordinate element in the language - no special gender agreement markers occurring only with coordinate phrases b) a coordinate structure with same gender elements behaves as if it has that same gender c) a coordinate structure with mixed gender may or may not behave as if it has the gender of one of its conjuncts 7
8 (9) NP NP + Conj NP ( GEN) ( GEN) ( GEN) ( GEN) 8
9 Hindi (10) meraa my rahte hãĩ live kuttaa dog MASC aur and SUBJ GEN MASC merii my billii cat FEM mere with saath me g h ar house My dog and my cat live with me in the house mẽ LOC (11) yah this larki girl FEM aur and uski her mãã mother FEM dilli Delhi mé LOC This girl and her mother live in Delhi rahtii live FEM hãĩ 9
10 conj1 conj2 resolves to (12) MASC MASC MASC FEM FEM FEM MASC FEM MASC FEM MASC MASC {M}: masc {}: fem 10
11 Icelandic if the conjuncts are all MASC use the MASC if the conjuncts are all FEM use the FEM otherwise use the NEUT (13) a. drengurinn the.boy(masc) og and telpan the.girl(fem) The boy and the girl are tired eru are ρreytt tired(neut) b. maδurinn the og man(masc) barniδ and The man and the bany are tired eru the.baby(neut) ρreytt are tired(neut) c. ég I sá saw á a.ewe(fem) og and lamb a.lamb(neut) I saw a ewe and a lamb, both black baeδi both svört blakc(neut) 11
12 resolves to MASC MASC MASC (14) FEM FEM FEM FEM MASC NEUT NEUT FEM NEUT NEUT MASC NEUT NEUT NEUT NEUT (15) {M}: {F}: {M,F} MASC FEM NEUT 12
13 Slovene (16) To drevo in gnezdo that tree(neut) and the nest(neut) ostala v spominu remain(masc) in memory na on.it njem to mi me That tree and the nest on it will remain in my memory resolves to MASC MASC MASC bosta will (17) MASC FEM MASC MASC NEUT MASC NEUT FEM MASC FEM FEM FEM NEUT NEUT MASC 13
14 (18) {F,N}: {F}: {N} MASC FEM NEUT Two possible analyses: resolution takes place as normal, using (18) but some other factor accounts for the appearance of MASC PL verbs with NEUT PL coordinate subjects. resolution is not standard - the neuter plural coordinate structure really is marked MASC: the value is determined independently of the conjuncts: (19) will do this. (19) CONJ: F ( GENDER) 14
15 Indeterminacy Indeterminate Values on Nouns: German Free Relatives (20) a. Wer who NOM nicht not gefördert supported S=N wird, is, muss must S=N Who isn t supported must be clever b. Ich I hab have O=A gegessen eaten I ate what was left was what? übrig was S=N war left klug clever sein. be 15
16 You cannot deal with this with disjunction or underspecification: (21) was: ( CASE) = NOM ( CASE) = ACC It seems to require features to be represented as sets of atomic values, to encode indeterminate feature possibilities. (22) was: ( CASE) = {NOM,ACC} (23) gegessen: ACC ( OBJ CASE) 16
17 (24) PRED CASE RELMOD WHAT {NOM,ACC} PRED SUBJ LEFT [ PRED CASE ] 17
18 (25) *Wem who.dat du you vertraust trust muss must klug be Whoever you trust must be clever (26) vertraust: DAT ( OBJ CASE) sein clever muss: wem: NOM ( SUBJ CASE) ( CASE) = {DAT} 18
19 The expression ( CASE) = {NOM,ACC} is a set designator, which indicates that the feature value is a set and also provides an exhaustive enumeration of the elements of the set. Explicit disjunction (denoted by the Boolean operator has an undesired wide scope interpretation but elements in a set are disjunctive only with respect to specific assertions of set membership. 19
20 Indeterminate Values on Nouns: Polish Coordinate Structures (27) Kogo who {ACC,GEN} Janek Janek lubi likes A O C a and Jerzy Jerzy Who does Janek like and Jerzy hate? nienawidzi hates G O C} 20
21 PRED OBJ SUBJ FOCUS LIKE JANEK [ PRED WHO CASE {ACC,GEN} ] PRED SUBJ FOCUS OBJ HATE JERZY (28) lubi: ACC ( OBJ CASE) nienawidzi: GEN ( OBJ CASE) kogo: ( CASE) = {ACC,GEN} 21
22 Indeterminate Feature Values on English Verbs (29) *I certainly will, and you already have, clarify the situation with respect to the budget I certainly will, and you already have, clarified the situation with respect to the budget I certainly will, and you already have, set the record straight with respect to the budget 22
23 Indeterminate Constraints Placed by Verbs: Xhosa (30) a. *Igqira doctor 5/6 b. *Igqira doctor 5/6 c. Izandla hands 7/8 nesanuse and-diviner 7/8 nesanuse and-diviner 7/8 needlebe and-ears 9/10 ayagoduka go home S C = 5/6 ziyagoduka go home S C = 7/8 zibomvu are-red SC { 7/8, 9/10 } The hands and the ears are red (31) zibomvu: ( SUBJ CLASS) {7/8, 9/10} 23
24 Indeterminate Value Requirements: German RNR Verbs (32) a. weil [wir(1) because we Garten kaufen] garden buy das the Haus house kaufen] buy und and [die the Müllers(3) Müllers because we buy the house and the Müllers buy the garden b. weil because [wir we das the Haus] house und and [die the Müllers Müllers den the Garten] garden den the kaufen buy because we [buy] the house and the Müllers buy the garden (33) kaufen: ( SUBJ PERS) { 1,3 } 24
25 Some Problem Cases Transitivity Problem in DK Modifiers and predicates must impose compatible agreement requirements (Levy, 2001): a noun that is indeterminately accusative or dative must take a dative modifier if the predicate requires dative, and an accusative modifier for an accusative predicate. This is not predicted by DK: (34) Er he hilft helps *die/den *the-acc/the-dat Papageien. parrots-acc/dat (German) (35) *Er hilft DAT OBJ CASE die ACC CASE Papageien. {DAT,ACC} (German) The following is based on Dalrymple et al. (2006) 25
26 Second Order Indeterminacy Problem in DK Features that are indeterminate (and thus set-valued) may have indeterminate requirements placed on them. For example, some Russian verbs require objects that are either genitive or accusative. Coordinated objects with one genitive and one accusative conjunct are also possible: (36) Včera ves den on proždal svoju yesterday all day he waited-for self s zvonka ot svoego brata Grigorija. call-gen from self s brother Gregory. podrugu girlfriend-acc (Russian) Irinu Irina Yesterday he waited all day for his girlfriend Irina and for a call from his brother Gregory. (Levy 2001) i and 26
27 (37) podrugu ( CASE ) = {ACC} zvonka proždal ( CASE ) = {GEN} ( OBJ CASE) = indeterminately ACC or GEN For DK, such interactions require a non-null intersection between the set of case values specified by the noun and the set required by the verb, a requirement that is not possible to impose within the standard formal assumptions of LFG. 27
28 CASE as a Complex Feature We treat CASE as a complex feature (f-structure), with attributes corresponding to each (core) case. Nouns and their modifiers specify negative values for the cases they do not express. Verbs specify positive values for the case(s) they require to be realized. (38a) is a fully determinate ACC specification, and (38b) is a partially indeterminate ACC/DAT specification: (38) a. CASE NOM ACC GEN DAT b. CASE NOM ACC GEN DAT 28
29 A verb requiring a DAT object combines with (38b) giving (40), but not with (38a): (39) verb-dat: ( OBJ CASE DAT) = + (40) OBJ CASE NOM ACC GEN DAT + 29
30 No clash results from simultaneously specifying two positive values for case: (41) Er he findet finds und and hilft helps Papageien. parrots-acc/dat (42) hilft: ( OBJ CASE DAT) = + (German) (43) findet: ( OBJ CASE ACC) = + 30
31 (44) SUBJ PRED OBJ [ PRED HE ] FIND SUBJ,OBJ PRED CASE c : PARROTS ACC + DAT + NOM GEN SUBJ PRED OBJ HELP SUBJ,OBJ This accounts for the cases of indeterminacy covered by the DK proposal. Succinct expression can be given to CASE specifications by using templates in the lexical entries. 31
32 Transitivity Problem Resolved Adjectives and Determiners state negative values for case features, placing further constraints on the case features of the noun they modify. (45) Strong form dative alten old : ((ADJ ) CASE NOM) = ((ADJ ) CASE ACC) = ((ADJ ) CASE GEN) = (46) Er he hilft helps *alte/alten *old-acc/old-dat He finds and helps old parrots. Papageien. parrots-acc/dat (German) (47) Fully indeterminate rosa pink : (no case specifications) 32
33 (48) Er findet he finds (German) und and hilft helps He finds and helps pink parrots. rosa pink-nom/acc/dat/gen Papageien. parrots-acc/dat 33
34 Second order Problem Resolved The verb proždat places indeterminate CASE requirements: (49) proždat : ( OBJ CASE {ACC GEN}) = + This allows the verb to govern coordinated objects with different case features, as long as each conjunct is compatible with a positive specification for either ACC or GEN. (50) podrugu: ( CASE NOM) = ( CASE GEN) = ( CASE DAT) = (51) zvonka: ( CASE ACC) = ( CASE NOM) = ( CASE DAT) = 34
35 (52) w : PRED WAIT.FOR SUBJ,OBJ SUBJ [ PRED HE] OBJ p : PRED GIRLFRIEND CASE NOM ACC + GEN DAT INST PREP z : PRED CALL CASE NOM ACC GEN + DAT INST PREP
36 References Corbett, Greville Hierarchies, Targets and Controllers: Agreement Patterns in Slavic. London: Croom Helm. Corbett, Greville G Agreement: A Partial Specification based on Slavonic Data. In Michael Barlow and Charles A. Ferguson, ed., Agreement in Natural Language, pages Stanford: CSLI. Corbett, Greville G Gender. Cambridge, UK: Cambridge University Press. Dalrymple, Mary, Tracy Holloway King, and Louisa Sadler Indeterminacy by Underspecification. LFG2006 and to appear. Levy, Roger Feature indeterminacy and the coordination of unlikes in a totally well-typed HPSG. Unpublished MS, Stanford University.
Unification. 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 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 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 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 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 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 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 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 informationName: Chemistry-Ms. Pickett Date: Element: Chemistry 6 Comprehensive Exam: Study Guide 1. Laboratory Safety a. Procedures b. Lab Equipment/ measurement tools 2. Properties of Matter a. Types of Matter
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 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 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 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 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 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 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 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 informationWord Order and the Floating Quantifier in Cebuano
Word Order and the Floating Quantifier in Cebuano Yumiko Ishikawa 1. Introduction The sentential subject long had been considered to be base-generated in Spec IP and to be assigned nominative Case under
More information7.1 What is it and why should we care?
Chapter 7 Probability In this section, we go over some simple concepts from probability theory. We integrate these with ideas from formal language theory in the next chapter. 7.1 What is it and why should
More informationWORKSHEET. Área: ingles Periodo: 1 Fecha: 26 feb al 2 Mar. Competencia: writing and grammar comprehension. Uses of the past tenses Part I
WORKSHEET Área: ingles Periodo: 1 Fecha: 26 feb al 2 Mar. Tema: Past Tenses Grado: 11th grade Competencia: writing and grammar comprehension Uses of the past tenses Part I The simple past tense is also
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 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 informationFeature Constraint Logics. for Unication Grammars. Gert Smolka. German Research Center for Articial Intelligence and. Universitat des Saarlandes
Feature Constraint Logics for Unication Grammars Gert Smolka German Research Center for Articial Intelligence and Universitat des Saarlandes Stuhlsatzenhausweg 3, D-66123 Saarbrucken, Germany smolka@dfki.uni-sb.de
More informationComputationele grammatica
Computationele grammatica Docent: Paola Monachesi Contents First Last Prev Next Contents 1 Unbounded dependency constructions (UDCs)............... 3 2 Some data...............................................
More informationIntroduction. Foundations of Computing Science. Pallab Dasgupta Professor, Dept. of Computer Sc & Engg INDIAN INSTITUTE OF TECHNOLOGY KHARAGPUR
1 Introduction Foundations of Computing Science Pallab Dasgupta Professor, Dept. of Computer Sc & Engg 2 Comments on Alan Turing s Paper "On Computable Numbers, with an Application to the Entscheidungs
More informationChiastic 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 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 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 informationReflexives and non-fregean quantifiers
UCLA Working Papers in Linguistics, Theories of Everything Volume 17, Article 49: 439-445, 2012 Reflexives and non-fregean quantifiers Richard Zuber It is shown that depending on the subject noun phrase
More informationSEMANTICS 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 informationReconsidering agreement
Reconsidering agreement Dr. Tania Avgustinova Habilitationskolloquium, 8. Juli 2003 Universität des Saarlandes 8 July 2003 Habilitationskolloquium, Universität des Saarlandes 2 The range of the phenomenon
More informationSemantics 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 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 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 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 Multi-Modal Combinatory Categorial Grammar. A MMCCG Analysis of Japanese Nonconstituent Clefting
A Multi-Modal Combinatory Categorial Grammar Analysis of Japanese Nonconstituent Clefting Department of Linguistics The Ohio State University {kubota,esmith}@ling.osu.edu A basic cleft sentence Data Clefting
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 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 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 informationINF4820: Algorithms for Artificial Intelligence and Natural Language Processing. Hidden Markov Models
INF4820: Algorithms for Artificial Intelligence and Natural Language Processing Hidden Markov Models Murhaf Fares & Stephan Oepen Language Technology Group (LTG) October 18, 2017 Recap: Probabilistic Language
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 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 informationEcient Higher-Order CRFs for Morphological Tagging
Ecient Higher-Order CRFs for Morphological Tagging Thomas Müller, Helmut Schmid and Hinrich Schütze Center for Information and Language Processing University of Munich Outline 1 Contributions 2 Motivation
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 informationStatistiek II. John Nerbonne. February 26, Dept of Information Science based also on H.Fitz s reworking
Dept of Information Science j.nerbonne@rug.nl based also on H.Fitz s reworking February 26, 2014 Last week: one-way ANOVA generalized t-test to compare means of more than two groups example: (a) compare
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 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 information1 Predicates and Arguments
Glue logic vs. Spreading Architecture in LFG * Avery Andrews, ANU, September, 2003 talk given at ALS2003, University of Newcastle, NSW comments welcome Although the f-structures of LFG look like an intuitively
More informationLIN1032 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 informationComputational Psycholinguistics Lecture 2: human syntactic parsing, garden pathing, grammatical prediction, surprisal, particle filters
Computational Psycholinguistics Lecture 2: human syntactic parsing, garden pathing, grammatical prediction, surprisal, particle filters Klinton Bicknell & Roger Levy LSA 2015 Summer Institute University
More informationINF4820: Algorithms for Artificial Intelligence and Natural Language Processing. Hidden Markov Models
INF4820: Algorithms for Artificial Intelligence and Natural Language Processing Hidden Markov Models Murhaf Fares & Stephan Oepen Language Technology Group (LTG) October 27, 2016 Recap: Probabilistic Language
More informationHardegree, Formal Semantics, Handout of 8
Hardegree, Formal Semantics, Handout 2015-03-24 1 of 8 1. Number-Words By a number-word or numeral 1 we mean a word (or word-like compound 2 ) that denotes a number. 3 In English, number-words appear to
More informationOctober 16 th 2015, Budapest Workshop on Linguistic and Cognitive aspects of Quantification
October 16 th 2015, Budapest Workshop on Linguistic and Cognitive aspects of Quantification The semantics and the acquisition of the distributive marker po, which is notorious, (common to Slavic and has
More informationIntroduction to Complexity Theory
Introduction to Complexity Theory Read K & S Chapter 6. Most computational problems you will face your life are solvable (decidable). We have yet to address whether a problem is easy or hard. Complexity
More informationPredicate Calculus. Lila Kari. University of Waterloo. Predicate Calculus CS245, Logic and Computation 1 / 59
Predicate Calculus Lila Kari University of Waterloo Predicate Calculus CS245, Logic and Computation 1 / 59 Predicate Calculus Alternative names: predicate logic, first order logic, elementary logic, restricted
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 informationLingua Latina. aestetix, 34c3 #milliways. "Semper ubi sub ubi."
Lingua Latina aestetix, 34c3 #milliways "Semper ubi sub ubi." https://slmc.uottawa.ca/content_images/2xx007e.gif http://static5.businessinsider.com/image/54c856a86bb3f7e17216e935-1250-938/language%20family%20tree_cropped.jpg
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 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 informationBoolean AND and the Semantic Correlates of Gradable Adjectives
Boolean AND and the Semantic Correlates of Gradable Adjectives Alan Bale (alanbale@mit.edu) September 13 th, 2007 1 Introduction General Issues: 1. What are the semantic properties correlated with being
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 informationCenter for Research in Urdu Language Processing National University of Computer and Emerging Sciences, Lahore Pakistan
Reference No: Revision History: POS ID: UPOS13 Name Change Date Version Description of Changes Omar Javed 06 th November, 0.1 Created 04 Sara Hussain 20 th Dec, 2004 4.1.0.0 Modified (added TENSE feature)
More informationHamblin semantics for Japanese and German (Kratzer and Shimoyama) *
Hamblin semantics for Japanese and German (Kratzer and Shimoyama) * 1. Recap: Unconditionals and Hamblin semantics Unconditionals Rawlins (2008) reports that unconditionals can be paraphrased as lists
More informationParasitic 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 informationD2: For each type 1 quantifier Q, Q acc (R) = {a : Q(aR) = 1}.
Some Formal Properties of Higher Order Anaphors R. Zuber Laboratoire de Linguistique Formelle, CNRS and University Paris-Diderot Richard.Zuber@linguist.univ-paris-diderot.fr Abstract Formal properties
More informationlist readings of conjoined singular which -phrases
list readings of conjoined singular which -phrases Andreea C. Nicolae 1 Patrick D. Elliott 2 Yasutada Sudo 2 NELS 46 at Concordia University October 18, 2015 1 Zentrum für Allgemeine Sprachwissenschaft
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 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 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 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 information3/29/2017. Logic. Propositions and logical operations. Main concepts: propositions truth values propositional variables logical operations
Logic Propositions and logical operations Main concepts: propositions truth values propositional variables logical operations 1 Propositions and logical operations A proposition is the most basic element
More informationSemantics and Pragmatics of NLP Pronouns
Semantics and Pragmatics of NLP Pronouns School of Informatics University of Edinburgh Outline Observations About Data 1 Observations of what factors influence the way pronouns get resolved 2 Some algorithms
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 informationQuantifier Scope in German: An MCTAG Analysis
Quantifier Scope in German: An MCAG Analysis Laura Kallmeyer University of übingen Collaborative Research Center 441 lk@sfs.uni-tuebingen.de Maribel Romero University of Pennsylvania Department of Linguistics
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 informationLIN1032 Formal Foundations for Linguistics
LIN1032 Formal Foundations for Lecture 1 Albert Gatt Practical stuff Course tutors: Albert Gatt (first half) albert.gatt@um.edu.mt Ray Fabri (second half) ray.fabri@um.edu.mt Course website: TBA Practical
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 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 informationProseminar on Semantic Theory Fall 2010 Ling 720 The Basics of Plurals: Part 1 1 The Meaning of Plural NPs and the Nature of Predication Over Plurals
The Basics of Plurals: Part 1 1 The Meaning of Plural NPs and the Nature of Predication Over Plurals 1. Introductory Questions and Guesses (1) Blindingly Obvious Fact about Natural Language There is number
More informationHardegree, Formal Semantics, Handout of 8
Hardegree, Formal Semantics, Handout 2015-04-07 1 of 8 1. Bound Pronouns Consider the following example. every man's mother respects him In addition to the usual demonstrative reading of he, x { Mx R[m(x),
More informationUniversals Across Languages
MTS@10 ESSLI 2007 preliminaries preliminaries Goals (M)...abstract fully away from the details of the grammar mechanism to express syntactic theories purely in terms of the properties of the class of structures
More informationPropositional Logic. Testing, Quality Assurance, and Maintenance Winter Prof. Arie Gurfinkel
Propositional Logic Testing, Quality Assurance, and Maintenance Winter 2018 Prof. Arie Gurfinkel References Chpater 1 of Logic for Computer Scientists http://www.springerlink.com/content/978-0-8176-4762-9/
More information3.8.1 Sum Individuals and Discourse Referents for Sum Individuals
3.8 Plural In many ways plural pronouns and noun phrases behave differently from singular pronouns. Here I will give an overview of several interesting phenomena, mainly following Kamp & Reyle (1993).
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 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 informationDesign and Evaluation of the Linguistic Basis of an Automatic F-Structure Annotation Algorithm for the Penn-II Treebank
Design and Evaluation of the Linguistic Basis of an Automatic F-Structure Annotation Algorithm for the Penn-II Treebank Mairead McCarthy M Sc m Computer Applications, School of Computing, Dublin City University
More informationSupplementary Logic Notes CSE 321 Winter 2009
1 Propositional Logic Supplementary Logic Notes CSE 321 Winter 2009 1.1 More efficient truth table methods The method of using truth tables to prove facts about propositional formulas can be a very tedious
More informationThe Flatness of LFG A Possible Solution Restructuring Predicates Linking with Glue. Unflattening LFG
Unflattening LFG Avery D Andrews The Australian National University April 2017, Universitat Pompeu Fabra Outline 1 The Flatness of LFG 2 A Possible Solution 3 Restructuring Predicates 4 Linking with Glue
More informationEigenwords. a quick intro. Lyle Ungar University of Pennsylvania. Lyle Ungar, University of Pennsylvania
Eigenwords a quick intro Lyle Ungar University of Pennsylvania Lyle Ungar, University of Pennsylvania Represent each word by its context I ate ham You ate cheese You ate context word Word Before Word After
More informationLecture 12: Algorithms for HMMs
Lecture 12: Algorithms for HMMs Nathan Schneider (some slides from Sharon Goldwater; thanks to Jonathan May for bug fixes) ENLP 17 October 2016 updated 9 September 2017 Recap: tagging POS tagging is a
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 information1 Write the subject pronoun for each picture. Use the words in the box.
1 Write the subject pronoun for each picture. Use the words in the box. I he she it we they 1 2_ 3 4 5_ 6 2. Label the pictures. Use the words in the box. Add the. chairs blackboard book desks rubber ruler
More informationProcessing Difficulty and Structural Uncertainty in Relative Clauses across East Asian Languages
Processing Difficulty and Structural Uncertainty in Relative Clauses across East Asian Languages Zhong Chen and John Hale Department of Linguistics Cornell University Incremental parsing... 0 Incremental
More informationS 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 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 informationCSC165. Larry Zhang, September 23, 2014
CSC165 Larry Zhang, September 23, 2014 Tutorial classrooms T0101, Tuesday 9:10am~10:30am: BA3102 A-F (Jason/Jason) BA3116 G-L (Eleni/Eleni) BA2185 M-T (Madina/Madina) BA2175 V-Z (Siamak/Siamak) T0201:
More informationPossessive Relation Disambiguation of Japanese Genitive Marker No
Possessive Relation Disambiguation of Japanese Genitive Marker No Sumiyo Nishiguchi Osaka University Study for the Language and Culture 33 Osaka University June 28, 2008 u301192b@ecs.cmc.osaka-u.ac.jp
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 information