

 Gavin Robertson
 1 years ago
 Views:
Transcription
1 Word order in LexicalFunctional Grammar Topics M. Kaplan and Mary Dalrymple Ronald Xerox PARC August 1995 Kaplan and Dalrymple, ESSLLI 95, Barcelona 1
2 phrase structure rules work well Standard congurational languages like English for S! NP S NP make it easy to encode subcategorization, and functions, and predicateargument relations grammatical Kaplan and Dalrymple, ESSLLI 95, Barcelona 2
3 Japanese: scrambling S NP NP V P Adj N P oikaketa N chase inu dog o ACC tiisai ga kodomotati NOM children small OR S NP NP V N P N P oikaketa Adj chase tiisai ga kodomotati NOM children small inu dog o ACC Kaplan and Dalrymple, ESSLLI 95, Barcelona 3
4 PRED Warlpiri: breakdown of phrasal grouping S NP Aux NP V NP N N kapala Pres wajilipinyi N chase kurdujarrarlu children maliki dog witajarrarlu small 3 2 PRED `chase' 2 3 PRED `children' 5 4 SUBJ SPEC `the' MODS f[ PRED `small' ]g 4 5 `dog' OBJ SPEC `the' Kaplan and Dalrymple, ESSLLI 95, Barcelona 4
5 ( AP LFG: Original rules with regular righthand sides allow for Cstructure considerable exibility Concatenation, Union, Kleeneclosure )!! V (NP) (NP) PP* (S) because of factoring of syntactic information into Possible domains: dierent Subcategorization is not dened congurationally Kaplan and Dalrymple, ESSLLI 95, Barcelona 5
6 >< >: ( AP ( AP ( AP >= >; Regular sets also closed under intersection and Observe: complementation E.g., suppose that NP and S cannot cooccur: )!! V (NP) (NP) PP* (S) { * NP * S * vs. 8 )! 9 (NP) (NP) PP* )!! V PP* (S) Kaplan and Dalrymple, ESSLLI 95, Barcelona
7 combinations of regular predicates: Boolean generalizations, but Factor don't change formal power or structural domain ID: S! [NP,] abbreviates S! [* NP *]\[NP* NP*] LP: NP < abbreviates :[* * NP *] S! NP can be factored to S! [ NP, ] \ [ NP < ] Kaplan and Dalrymple, ESSLLI 95, Barcelona
8 ( AD PP Ignore Adverbs! V [(NP) (NP) PP* () (S)]/AD Equivalent, but misses a generalization: )! V AD* (NP) AD* (NP) * () AD* (S) [A B]/C A B C C C Kaplan and Dalrymple, ESSLLI 95, Barcelona 8
9 crossserial dependencies: Germanic cstructure to functional constraints on word order Beyond Kaplan and Dalrymple, ESSLLI 95, Barcelona 9
10 dependencies in Dutch Crossserial (195): Flat cstructure Evers S 0 dat S NP NP NP V 0 Jan zijn zoon geneeskunde V V 0 wil V V 0 laten studeren Kaplan and Dalrymple, ESSLLI 95, Barcelona 10
11 V 0! V for crossserial dependencies: Accounting Kaplan, Peters, and Zaenen (1982) Bresnan, V A! NP (" OBJ)=# (" XCOMP)=# 1 V 0 A (" XCOMP)=# Assumes hierarchical constituent structure Kaplan and Dalrymple, ESSLLI 95, Barcelona 11
12 zijn his 0 V NP zoon son NP V V 0 geneeskunde medicine wil wanted V V 0 laten let studeren study S 0 dat S NP Jan 3 2 SUBJ [`Jan'] 3 PRED `want' 2 SUBJ PRED `let' OBJ [`his son'] 3 XCOMP 2 SUBJ XCOMP 5 PRED `study' 5 OBJ [`medicine'] Kaplan and Dalrymple, ESSLLI 95, Barcelona 12
13 with the Bresnan et al. (1982) solution: Problems dominance chains (Johnson 198) Nonbranching S 0 dat S NP Jan V 0 V V 0 NP heeft has V V 0 een a liedje song willen wanted V zingen sing Kaplan and Dalrymple, ESSLLI 95, Barcelona 13
14 with the Bresnan et al. (1982) solution: Problems of complex structures (Moortgat) Coordination.. dat Jan een liedje schreef en trachtte te verkopen.... that Jan a song wrote and tried to sell.. Kaplan and Dalrymple, ESSLLI 95, Barcelona 14
15 SUBJ)=# (" NP =# " OBJ)=# OR (" XCOMP OBJ)=# (" =# " 0 V #2" 0 #2" V 0 V =# " V =# " V XCOMP)=# (" 0 V =# " V S Jan NP een liedje schreef trachtte te verkopen Kaplan and Dalrymple, ESSLLI 95, Barcelona 15
16 uncertainty eliminates nonbranching chains: Functional (198) Johnson V A! NP (" OBJ)=# (" XCOMP + )=# Also solves the coordination problem Kaplan and Dalrymple, ESSLLI 95, Barcelona 1
17 Nonbranching dominance chains eliminated S 0 dat S NP Jan NP V 0 een liedje V V 0 heeft V V 0 willen V zingen Kaplan and Dalrymple, ESSLLI 95, Barcelona 1
18 But how to correlate word order and grammatical functions? S 0 dat S NP NP NP V 0 Jan zijn his zoon son geneeskunde medicine V V 0 wil wanted V V 0 laten let studeren study Kaplan and Dalrymple, ESSLLI 95, Barcelona 18
19 cats) holds i CAT(f; is some n 2 1 (f) such that (n) 2 cats there Description by inverse correspondence inverse of the correspondence relation The fstructure properties based on cstructure relations induces f1: h SUBJ f2:[ ] i n1:s n2:np n3: n4:n n5:v Example: Fstructure \category" Thus: CAT(f1, S), CAT(f1, V), but not CAT(f2, ) Kaplan and Dalrymple, ESSLLI 95, Barcelona 19
20 PRED) = `becomeh(" SUBJ), (" XCOMP)i' (" XCOMP SUBJ) = (" SUBJ) (" XCOMP), fa, Ng) _ CAT((" XCOMP), N) CAT((" Complement selection by functional category become became a leader. John became tall. John John became in the park. * John became to go. * compare ACOMP, VCOMP,... (Kaplan and Bresnan 1982) Kaplan and Dalrymple, ESSLLI 95, Barcelona 20
21 [ ] [ ] A Functional View of XBar Theory A maximal node n can be of category XP if CAT((n), X). XP X justies an XP label This though the XP does not dominate an X: even XP X Kaplan and Dalrymple, ESSLLI 95, Barcelona 21
22 order on strings (dening relation) Total order on trees (dening relation) Partial word order possibilities: Functional Precedence Constraining 1984, Kaplan 198) (Bresnan Precedence: Not dened on fstructure Cprecedence < c naturally induces an fstructure But: relation < f via inverse of correspondence \precedence" Kaplan and Dalrymple, ESSLLI 95, Barcelona 22
23 f1 < f f2 i for all n1 2 1 (f1) and for all n2 2 1 (f2), n1 < c n2 1 partitions cstructure nodes into equivalence classes is manytoone because Functional Precedence two fstructure elements f1 and f2, f 1 fprecedes f2 if and For if all the nodes that map onto f1 cprecede all the nodes only that map onto f2: Kaplan and Dalrymple, ESSLLI 95, Barcelona 23
24 f1 < f f2 f1 < f f3 f2 < f f3 4 5 Example: 3 2 ] f1:[ ] f2:[ f3:[ ] Kaplan and Dalrymple, ESSLLI 95, Barcelona 24
25 f1 < f f2 f2 < f f1 but f1 = f2 and f1 < f f1 Some properties of fprecedence: Not antisymmetric, not transitive ) not an order because is not onto 2 3 f1:[ ] 4 5 f2:[ ] Kaplan and Dalrymple, ESSLLI 95, Barcelona 25
26 ball fell. The the ball. Fell dog chased the ball. The Chased the ball the dog. * NP SUBJ NP OBJ Some properties of fprecedence: Can order nonsisters! NP, S ] [ S f (" OBJ) < SUBJ) (" V Kaplan and Dalrymple, ESSLLI 95, Barcelona 2
27 Anaphora word order (Zaenen and Kaplan 1994) Constrained/free crossover (Bresnan 1984, 1994) Weak slightly dierent denition) (with Applications: etc. Kaplan and Dalrymple, ESSLLI 95, Barcelona 2
28 B C Rules for Dutch! NP V 0 (" XCOMP OBJ)=# V XCOMP)=# (" V 0! V (" XCOMP + OBJ) < f (" OBJ) Kaplan and Dalrymple, ESSLLI 95, Barcelona 28
29 Extending the solution to Swiss German.. das [er] [sini chind] [mediziin] wil la schtudiere.... that [he] [his children] [medicine] wants let study.... `that he wants to let his children study medicine.'.. das [er] wil [sini chind] la [mediziin] schtudiere.... das [er] [sini chind] wil la [mediziin] schtudiere.... das [er] [mediziin] [sini chind] wil la schtudiere.... das [er] [sini chind] wil [mediziin] la schtudiere.. But:... das [er] wil la [sini chind] [mediziin] schtudiere. *... that [he] wants let [his children] [medicine] study Generalization: the nominal arguments of a particular verb precede it. All Kaplan and Dalrymple, ESSLLI 95, Barcelona 29
30 0! V V f (" NGF) #< All the nominal arguments of a particular verb precede it:! [ NP (" XCOMP NGF)=# V 0, XCOMP )=# (" ] Kaplan and Dalrymple, ESSLLI 95, Barcelona 30
31 Topicalization in Dutch: NP dependents can be topicalized, even from within an All XCOMP: boek] heeft Jan de kinderen laten lezen. [Het book has Jan the children let read. The `Jan let the children read this book'. on wordorder that apply to dependents in their Restrictions positions do not operate when those elements middleeld appear in topic (foreeld) position. Kaplan and Dalrymple, ESSLLI 95, Barcelona 31
32 XCOMP + )=# (" C A Generalization about middleeld word order: S 0! XP S, where XP = f j 9 j : : :g NP 8 = < XCOMP (" NGF) = # ; : COMP V 0! NP (" XCOMP NGF)=# V XCOMP)=# (" V 0! V (" XCOMP + NGF)< f (" NGF) But topicalized elements do not satisfy this constraint. Kaplan and Dalrymple, ESSLLI 95, Barcelona 32
33 S 0 NP S het boek V NP NP V 0 heeft Jan de kinderen laten lezen 2 3 TOPIC [the book] let PRED SUBJ [Jan] [the children] 2 3 OBJ PRED read XCOMP SUBJ 5 OBJ the book fprecedes Jan and the children! Kaplan and Dalrymple, ESSLLI 95, Barcelona 33
34 and n2 are Xcodominated i the lowest node of type X that n1 n1 is also the lowest node of type X that dominates n1 n 2 n1 n1 and n2 are n2 n1 n2 n1 and n2 are the condition: Rening ordering conditions to operate Restrict just within the domain Dene: dominates n2. NP NP codominated NOT codominated Kaplan and Dalrymple, ESSLLI 95, Barcelona 34
35 fprecedes f2 relative to X i for all n 1 in 1 (f1) and for all f1 in 1 (f2), n1 and n2 are Xcodominated and n1 < c n2. n2 We write: f1 <X f f2 Relativized fprecedence: For two fstructure elements f1 and f2 and a category X, Kaplan and Dalrymple, ESSLLI 95, Barcelona 35
36 XCOMP + NGF)< f (" NGF) (" C A Dutch topicalization: Fprecedence relative to 0 1 V 0! V 0 V XCOMP)=# (" Imposes ordering constraints only on codominated nodes between foreeld nodes Constraints between middleeld nodes Constraints No constraints between foreeld and middleeld Kaplan and Dalrymple, ESSLLI 95, Barcelona 3
37 Some dicult word order constraints can be captured with exible cstructure notation LFG's More complex word order constraints involve an interaction functional and phrasal requirements between The LFG correspondence architecture provides mathematically precise and linguistically useful notions for expressing Summary such constraints Kaplan and Dalrymple, ESSLLI 95, Barcelona 3
On Dutch allemaal and West Ulster English all
On Dutch allemaal and West Ulster English all Hilda Koopman UCLA This squib compares the similar distributions of floating allemaal and all under whmovement in Dutch and West Ulster English (WUE) (McCloskey
More informationA stepbystep introduction to the Government and Binding theory of syntax
A stepbystep introduction to the Government and Binding theory of syntax Cheryl A. Black SIL  Mexico Branch and University of North Dakota Designed for use as a textbook, this paper provides a datamotivated,
More informationMaking Sense of Dutch Word Order
Making Sense of Dutch Word Order Dick Grune dick@dickgrune.com Version 1.2.1 (October 10, 2013) Note: Although Dutch and Flemish are officially the same language, the explanation below does not apply as
More informationThe Rise and Fall of Constructions and the History of English DoSupport
Journal of Germanic Linguistics 20.1 (2008):1 52 The Rise and Fall of Constructions and the History of English DoSupport Peter W. Culicover The Ohio State University and Eberhard Karls Universität Tübingen
More informationHow many numbers there are?
How many numbers there are? RADEK HONZIK Radek Honzik: Charles University, Department of Logic, Celetná 20, Praha 1, 116 42, Czech Republic radek.honzik@ff.cuni.cz Contents 1 What are numbers 2 1.1 Natural
More informationEach copy of any part of a JSTOR transmission must contain the same copyright notice that appears on the screen or printed page of such transmission.
Three Reasons for Not Deriving "Kill" from "Cause to Die" Author(s): J. A. Fodor Source: Linguistic Inquiry, Vol. 1, No. 4 (Oct., 1970), pp. 429438 Published by: The MIT Press Stable URL: http://www.jstor.org/stable/4177587.
More informationNo Escape From Syntax: Don't Try Morphological Analysis in the Privacy of Your Own Lexicon
No Escape From Syntax: Don't Try Morphological Analysis in the Privacy of Your Own Lexicon in "Proceedings of the 1998 Penn Linguistics Colloqium", ed. by Alexis Dimitriadis, available from Penn Working
More informationDependent Types at Work
Dependent Types at Work Ana Bove and Peter Dybjer Chalmers University of Technology, Göteborg, Sweden {bove,peterd}@chalmers.se Abstract. In these lecture notes we give an introduction to functional programming
More informationWhich Semantics for Neighbourhood Semantics?
Which Semantics for Neighbourhood Semantics? Carlos Areces INRIA Nancy, Grand Est, France Diego Figueira INRIA, LSV, ENS Cachan, France Abstract In this article we discuss two alternative proposals for
More informationA Fresh Look at Habitual Be in AAVE Chris Collins New York University
A Fresh Look at Habitual Be in AAVE Chris Collins New York University 1. Introduction 1 In this paper, I will describe the use of agentive be in informal American English, basing my analysis primarily
More informationRegular Languages are Testable with a Constant Number of Queries
Regular Languages are Testable with a Constant Number of Queries Noga Alon Michael Krivelevich Ilan Newman Mario Szegedy Abstract We continue the study of combinatorial property testing, initiated by Goldreich,
More informationNonnominal WhichRelatives
Nonnominal WhichRelatives Doug Arnold, Robert D. Borsley University of Essex The properties of nonrestrictive relatives All nonrestrictive relative clauses include a whword. There are no that or zero
More informationComputational Models of Sentence Production: A Dualpath Approach. Franklin Chang Hartmut Fitz
1 Computational Models of Sentence Production: A Dualpath Approach Franklin Chang Hartmut Fitz Corresponding Author: Franklin Chang School of Psychology The University of Liverpool Eleanor Rathbone Building
More informationLess Grammar, More Features
Less Grammar, More Features David Hall Greg Durrett Dan Klein Computer Science Division University of California, Berkeley {dlwh,gdurrett,klein}@cs.berkeley.edu Abstract We present a parser that relies
More information= 2 + 1 2 2 = 3 4, Now assume that P (k) is true for some fixed k 2. This means that
Instructions. Answer each of the questions on your own paper, and be sure to show your work so that partial credit can be adequately assessed. Credit will not be given for answers (even correct ones) without
More informationA Study of The Fragile Base Class Problem Leonid Mikhajlov 1 and Emil Sekerinski 2 1 Turku Centre for Computer Science, Lemminkaisenkatu 14A, Turku 20520, Finland; lmikhajl@aton.abo. 2 McMaster University,
More informationMaintaining Knowledge about Temporal Intervals
/ESEARCH COKrNBlmONS Maintaining Knowledge about Temporal Intervals JAMES F. ALLEN The University of Rochester lames F. Allen's main interests are in artificial intelligence in particular natural language
More informationWhat VP Ellipsis Can Do, and What it Can t, but not Why *
What VP Ellipsis Can Do, and What it Can t, but not Why * Kyle Johnson University of Massachusetts Amherst VP Ellipsis is the name given to instances of anaphora in which a missing predicate, like that
More informationShort Cycles make Whard problems hard: FPT algorithms for Whard Problems in Graphs with no short Cycles
Short Cycles make Whard problems hard: FPT algorithms for Whard Problems in Graphs with no short Cycles Venkatesh Raman and Saket Saurabh The Institute of Mathematical Sciences, Chennai 600 113. {vraman
More informationBasics of Compiler Design
Basics of Compiler Design Anniversary edition Torben Ægidius Mogensen DEPARTMENT OF COMPUTER SCIENCE UNIVERSITY OF COPENHAGEN Published through lulu.com. c Torben Ægidius Mogensen 2000 2010 torbenm@diku.dk
More information12. FiniteState Machines
2. FiniteState Machines 2. Introduction This chapter introduces finitestate machines, a primitive, but useful computational model for both hardware and certain types of software. We also discuss regular
More informationSwitching Algebra and Logic Gates
Chapter 2 Switching Algebra and Logic Gates The word algebra in the title of this chapter should alert you that more mathematics is coming. No doubt, some of you are itching to get on with digital design
More informationDan Sperber An objection to the memetic approach to culture
Dan Sperber An objection to the memetic approach to culture (in Robert Aunger ed. Darwinizing Culture: The Status of Memetics as a Science. Oxford University Press, 2000, pp 163173) Memetics is one possible
More informationC HAPT ER 4. 4.1 Distributivity
C HAPT ER 4 DIST RIB UTIVIT Y AND DIF F ERENT IATION: THE UNIVERSAL QUANT IF IERS EACH AND EV ERY Each and every are both universal quantifiers, in contrast to most, some, a few, etc. Sentences containing
More informationEmbodied Construction Grammar Benjamin Bergen Nancy Chang
Embodied Construction Grammar Benjamin Bergen Nancy Chang 1. Introduction 1.1 A cognitive science approach to grammar Theories of grammar are defined by the questions they ask. In the analytical linguistic
More informationANAPHORIC ONE AND ITS IMPLICATIONS *
ANAPHORIC ONE AND ITS IMPLICATIONS * JOHN PAYNE University of Manchester BARBARA C. SCHOLZ University of Edinburgh GEOFFREY K. PULLUM Brown University and University of Edinburgh EVA BERLAGE Universität
More informationA Puzzle about Ontology
NO ^US 39:2 (2005) 256 283 A Puzzle about Ontology THOMAS HOFWEBER University of North Carolina at Chapel Hill 1 Ontology Ontology is the philosophical discipline that tries to find out what there is:
More informationSubspace Pursuit for Compressive Sensing: Closing the Gap Between Performance and Complexity
Subspace Pursuit for Compressive Sensing: Closing the Gap Between Performance and Complexity Wei Dai and Olgica Milenkovic Department of Electrical and Computer Engineering University of Illinois at UrbanaChampaign
More informationTwodimensional Languages
Charles University Faculty of Mathematics and Physics Mgr. Daniel Průša Twodimensional Languages Doctoral Thesis Supervisor: Martin Plátek, CSc. Prague, 2004 Acknowledgements The results presented in
More informationScope or Pseudoscope? Are there WideScope Indefinites? 1
1 Scope or Pseudoscope? Are there WideScope Indefinites? 1 Angelika Kratzer, University of Massachusetts at Amherst March 1997 1. The starting point: Fodor and Sag My story begins with a famous example
More information