A Formal Account, p. 1

Similar documents
Constraints in Phrase Structure Grammar

Non-nominal Which-Relatives


A Beautiful Four Days in Berlin Takafumi Maekawa (Ryukoku University)

LG400 IT Induction Course: Writing a Linguistic Thesis on MS Word Ver. 1.1, 21 Jan 2005

English Descriptive Grammar

Outline of today s lecture

Phrase Structure Rules, Tree Rewriting, and other sources of Recursion Structure within the NP

A cloud-based editor for multilingual grammars

L130: Chapter 5d. Dr. Shannon Bischoff. Dr. Shannon Bischoff () L130: Chapter 5d 1 / 25

Francis Y. LIN Alex X. PENG (School of Foreign Languages and Literatures / Beijing Normal University)

CINTIL-PropBank. CINTIL-PropBank Sub-corpus id Sentences Tokens Domain Sentences for regression atsts 779 5,654 Test

Anaphoric binding and. Topics in Lexical-Functional Grammar. Ronald M. Kaplan and Mary Dalrymple. Xerox PARC. August 1995

Paraphrasing controlled English texts

Extended Projections of Adjectives and Comparative Deletion

Structure of Clauses. March 9, 2004

AUTOMATIC F-STRUCTURE ANNOTATION FROM THE AP TREEBANK

Double Genitives in English

Understanding English Grammar: A Linguistic Introduction

Movement and Binding

Generalized Tree Descriptions for LFG

ž Lexicalized Tree Adjoining Grammar (LTAG) associates at least one elementary tree with every lexical item.

Torben Thrane* The Grammars of Seem. Abstract. 1. Introduction

Syntax: Phrases. 1. The phrase

Mixed Sentence Structure Problem: Double Verb Error

Special Topics in Computer Science

Constituency. The basic units of sentence structure

IP PATTERNS OF MOVEMENTS IN VSO TYPOLOGY: THE CASE OF ARABIC

COMPARATIVES WITHOUT DEGREES: A NEW APPROACH. FRIEDERIKE MOLTMANN IHPST, Paris fmoltmann@univ-paris1.fr

Keywords academic writing phraseology dissertations online support international students

Proceedings of the LFG02 Conference. National Technical University of Athens, Athens. Miriam Butt and Tracy Holloway King (Editors) CSLI Publications

Background. Project Structure. Deep CALL grammars: The LFG-OT Experiment

Chapter 13, Sections Auxiliary Verbs CSLI Publications

LESSON THIRTEEN STRUCTURAL AMBIGUITY. Structural ambiguity is also referred to as syntactic ambiguity or grammatical ambiguity.

Structure of the talk. The semantics of event nominalisation. Event nominalisations and verbal arguments 2

MARY. V NP NP Subject Formation WANT BILL S

A Minimalist View on the Syntax of BECOME *

Errata: Carnie (2008) Constituent Structure. Oxford University Press (MAY 2009) A NOTE OF EXPLANATION:

CURRICULUM VITAE. Whitney Tabor. Department of Psychology University of Connecticut Storrs, CT U.S.A.

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

A Chart Parsing implementation in Answer Set Programming

Sentence Structure/Sentence Types HANDOUT

The Book of Grammar Lesson Six. Mr. McBride AP Language and Composition

The compositional semantics of same

Right Node Raising and the LCA

Learning Translation Rules from Bilingual English Filipino Corpus

English prepositional passive constructions

Structural and Semantic Indexing for Supporting Creation of Multilingual Web Pages

Tense as an Element of INFL Phrase in Igbo

Continuous Acceptability, Categorical Grammaticality, and Experimental Syntax

What s in a Lexicon. The Lexicon. Lexicon vs. Dictionary. What kind of Information should a Lexicon contain?

Noam Chomsky: Aspects of the Theory of Syntax notes

CS510 Software Engineering

Extraposition, the Right Roof Constraint, Result Clauses, Relative Clause Extraposition, and PP Extraposition

NON-CORE PARTICIPANT PPS ARE ADJUNCTS. György Rákosi. University of Debrecen. Proceedings of the LFG12 Conference

the primary emphasis on explanation in terms of factors outside the formal structure of language.

Chapter 1. Introduction Topic of the dissertation

Differences in linguistic and discourse features of narrative writing performance. Dr. Bilal Genç 1 Dr. Kağan Büyükkarcı 2 Ali Göksu 3

Peeling Back the Layers Sister Grade Seven

INVESTIGATING DISCOURSE MARKERS IN PEDAGOGICAL SETTINGS:

Ling 201 Syntax 1. Jirka Hana April 10, 2006

Symbiosis of Evolutionary Techniques and Statistical Natural Language Processing

Each 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.

INCREASE YOUR PRODUCTIVITY WITH CELF 4 SOFTWARE! SAMPLE REPORTS. To order, call , or visit our Web site at

Modeling coherence in ESOL learner texts

Likewise, we have contradictions: formulas that can only be false, e.g. (p p).

How To Understand A Sentence In A Syntactic Analysis

VP-TOPICALIZATION AND THE VERB GJØRE IN NORWEGIAN 1

University of Massachusetts Boston Applied Linguistics Graduate Program. APLING 601 Introduction to Linguistics. Syllabus

The syntactic positions of adverbs and the Second Language Acquisition

ELLIPSIS AND REPAIR EFFECTS * Seichi Sugawa Nanzan University and Nagoya Gakuin University

Introducing Formal Methods. Software Engineering and Formal Methods

Syntactic Theory on Swedish


Lecture 9. Phrases: Subject/Predicate. English 3318: Studies in English Grammar. Dr. Svetlana Nuernberg

DEFINING AND COMPUTING EQUIVALENT INDUCTANCES OF GAPPED IRON CORE REACTORS

UNIVERSITY COLLEGE LONDON EXAMINATION FOR INTERNAL STUDENTS

Artificial Intelligence Exam DT2001 / DT2006 Ordinarie tentamen

UNIVERSITÀ DEGLI STUDI DELL AQUILA CENTRO LINGUISTICO DI ATENEO

The Cambridge English Scale explained A guide to converting practice test scores to Cambridge English Scale scores

Teacher s Guide for Let s Go Mastery Tests

Culture and Language. What We Say Influences What We Think, What We Feel and What We Believe

Appendix to Chapter 3 Clitics

Superiority: Syntax or Semantics? Düsseldorf Jul02. Jill devilliers, Tom Roeper, Jürgen Weissenborn Smith,Umass,Potsdam

NATURAL LANGUAGE QUERY PROCESSING USING PROBABILISTIC CONTEXT FREE GRAMMAR

Language as Cognitive Science

Impossible Words? Jerry Fodor and Ernest Lepore

A discourse approach to teaching modal verbs of deduction. Michael Howard, London Metropolitan University. Background

Design Patterns in Parsing

Slot Grammars. Michael C. McCord. Computer Science Department University of Kentucky Lexington, Kentucky 40506

Discourse Markers in English Writing

Interactive Dynamic Information Extraction

Lecture 1. Basic Concepts of Set Theory, Functions and Relations

Scrambling in German - Extraction into the Mittelfeld

Row Echelon Form and Reduced Row Echelon Form

Text Generation for Abstractive Summarization

Parsing Natural Language using LDS: A Prototype

Syntactic Structure Clause Structure: Clause Pattern: Lexical Pattern:

Actuality and fake tense in conditionals *

An HPSG analysis of a beautiful two weeks * 1

Transcription:

A Formal Account, p. 1 Some LFG Basics Consider the sentence The librarian put a book on the shelf. (1) constituent structure (c-structure): functional structure (f-structure): S PRED librarian DEF + VP PAST PRED put ( )( )( ) the librarian V PP DEF + PRED book put the book on the shelf NUM SG PRED on ( ) DEF + PRED shelf NUM SG In LFG, the two levels of representation, the structural and the functional, are in a relation of correspondence with each other. For example, the S, VP, and V nodes in the c-structure correspond to the outermost layer of f-structure, the node the librarian and all its daughter nodes correspond to the f-structure PRED librarian, etc. DEF + The on the arguments in the specification of argument-taking predicates restricts the argument to a local one. For example, the argument of put is filled by the book and not the table, even though both bear the function. They bear the function in different local f-structures. ( ) represents a path through the f-structure: means the local f-structure. (2) : PRED put ( ) DEF PRED NUM [ ] + shelf SG Similarly, the which fills the argument position of on is in its local f-structure.

A Formal Account, p. 2 (3) : PRED ( ) DEF PRED NUM on + shelf SG If we wanted to refer to the of on from the perspective of put, we would have to specify a two-step path: ( ). (4) PRED on ( ) : DEF + PRED shelf NUM SG These are inward paths through the f-structure (called outside-in ). We can also designate an outward ( inside-out ) path. If we start at the f-structure corresponding to the of on (the one headed by table ), an inside-out path to the outermost f-structure would be: ( ). (5) PRED DEF + : PRED shelf NUM SG on ( ) In addition to, there is a. They both appear in annotations to phrase structure rules defining the c-structure f-structure mapping. (6) S NP VP ( ) = = The annotation on the NP means the f-structure you get to by starting at the f-structure corresponding to S and going through the attribute is the f-structure corresponding to NP, and the annotation on the VP means the f-structure corresponding to the S is identical to the f-structure corresponding to the VP. For our purposes, we need not go into the formal details of the correspondence, but we will need to use the arrow notation. Technically, the arrows are called metavariables. To make the structure-function mapping in a particular situation clear, we can annotate these equations to

A Formal Account, p. 3 positions in the c-structure: (7) S ( ) = = VP the librarian V PP put the book on the shelf This is not a distinct level of representation in LFG; it is simply a notational convenience (like drawing an arrow representing movement in GB). In this handout, we will do this only where necessary for the point. For a textbook-level introduction to LFG, see Falk 2001. More advanced references/textbooks are Bresnan 2001 and Dalrymple 2001. The representation of wh constructions In LFG, the f-structure of what the librarian put on the shelf can be represented as follows: (8) } [ what ] [ the librarian ] PRED PAST put ( )( )( ) PRED on ( ) [ the shelf ] Here, we have indicated that what is both the and the of the clause, using a fairly intuitive (nonstandard) notation. The problem is that this way of representing multiple functions is difficult to use if the functions are in different clauses. We might do something like the following for what the teacher thinks the librarian put on the shelf:

A Formal Account, p. 4 (9) f PRED COMP COMP PRED = [ what ] f [ the teacher ] PRES think ( )( ) [ the librarian ] PAST put ( )( )( ) f [ on the shelf ] The usual LFG notation is to draw a curved line connecting the two functions. (This is usually done even when the two functions are in the same clause.) (10) a. [ what ] [ the teacher ] PRES think ( )( ) [ the librarian ] PAST put ( )( )( ) [ on the shelf ] PRED COMP COMP PRED b. PRED COMP COMP [ the teacher ] PRES think ( )( ) [ the librarian ] PAST PRED put ( )( )( ) [ what ] [ on the shelf ]

A Formal Account, p. 5 Whatever the notation, this shows what as being the of the main clause and the of the subordinate clause. This is a direct representation of the multifunctionality of the wh element. Licensing wh constructions The LFG system for licensing the multifunctionality of wh elements was first outlined by Kaplan and Zaenen (1989). The basic idea is that one element gets two functions by specifying the f-structure path between them. This can be done either by starting at the discourse function and working inward ( outside-in ) to the argument function, or by starting at the argument function and working outward ( inside-out ) to the discourse function. The c-structures look different in the two cases: going outside-in there is no need for an empty category in the position of the gap, but going inside-out there is one (or at least might be; we will discuss the question of empty categories in Semester B). This can be illustrated by showing the c-structures of the sample sentence, including partial functional annotation. (For convenience, the trees are not full trees.) (11) a. outside-in licensing CP ( ) = S ( ) = ( COMP* GF) VP what the teacher V ( COMP) = S thinks VP the librarian V PP put on the shelf

A Formal Account, p. 6 b. inside-out licensing (with empty category) CP ( ) = S what VP the teacher V ( COMP) = S thinks NP VP the librarian V ( ) = PP put on the shelf e = ((COMP* GF ) DF The outside-in licensing approach (without empty category) is the one taken in the original Kaplan and Zaenen article, and, more recently, by Dalrymple, Kaplan, and King (2001) and Dalrymple (2001). The alternative inside-out licensing approach (with empty categories) has been argued for by Bresnan (1995; 2001). Falk (2000; 2001; 2007) argues for a mixed approach, in which subject extraction is licensed outsidein and non-subject extraction is licensed inside-out. Whether outside-in or inside-out, the path between the two grammatical functions is expressed in terms of a sequence of f-structure attributes (COMP in this example) of unspecified length (this is the meaning of the Kleene star operator on COMP). Because of the fact that the path is not unique (due to the unspecified length of the sequence of COMPs) this kind of specification is called functional uncertainty. One of the advantages of this approach to wh constructions is that the long-distance relationship is licensed locally, one layer of f-structure at a time. Constructional properties of wh constructions can be linked to an f-structure feature specifying (CLAUSE)TYPE. Limiting ourselves to the values DECL, REL, and Q, since the complementizer that can occur in declaratives and relative clauses, it will have the lexical specification: (12) ( TYPE) = DECL REL On the other hand, clause type is not always expressed by the complementizer; a clause introduced by what in [SPEC, CP] has to be a question, for example. The lexical entry of what includes the following lexical specification:

A Formal Account, p. 7 (13) (( ) TYPE) = Q The path here is a combination of inside-out and outside-in specification: (14) TYPE Q [ ] : what For wh constructions with no overt filler, LFG generally adopts what is essentially a functional equivalent of the empty operator analysis. For example, in a study of the Tough Movement construction, Dalrymple and King (2000) argue for the following f-structure. (This is somewhat simplified; the layer of structure associated with are has been omitted.) (15) a. Moths are tough to kill. b. PRED moth NUM PL INDEX i PRED tough ( )( COMP) PRED PRO TOPIC INDEX i PRED PRO COMP INDEX arb PRED kill ( )( ) The TOPIC of the complement is an unexpressed pronoun. The lower end of the tough LDD must be an ; one way to do this (slightly different from Dalrymple and King) is to have the following as part of the lexical entry of tough: (16) ( ( COMP TOPIC)) i.e. tough s complement s topic is an object Pied-piping constructions are analyzed by treating the relationship between the actual operator and the entire filler as another LDD construction. The f-structure of Whose book did the librarian put on the shelf? is:

A Formal Account, p. 8 (17) a. OPER [ whose ] PRED PRED book POSS PAST [ Ross ] put ( )( )( ) [ on the shelf ] b. OPER PRED g f PAST [ Ross ] put ( )( )( ) f [ on the shelf ] PRED book f = POSS g g = [ whose ] This is licensed by associating the following functional specification with the [SPEC, CP] node: (18) ( OPER) = ( GF*) (This specific implementation is based on Falk 2001; see also Kaplan and Bresnan 1982 and Dalrymple 2001). Of Historical Interest Only Early LFG (e.g. Kaplan and Bresnan 1982) licensed multifunctionality in wh constructions not directly at the level of f-structure but rather indirectly through c-structure. In this system, the filler constituent is associated with a metavariable and an empty category in the gap position is associated (nonlocally!) with a matching metavariable. Bounding nodes, à la Subjacency, block the matching of and. (The boxed node is a bounding node, and the dotted lines show how the long-distance metavariables are matched up.)

A Formal Account, p. 9 (19) CP ( ) = S = VP what the teacher V = S thinks VP the librarian V PP put e on the shelf = Within this framework, Falk (1983) argued (following Gazdar s work in GPSG) that subject wh constructions are different, and do not have an empty category (or trace). There were a few other studies of wh constructions in this framework as well; we will be reading one later in the course. References Blake, Barry J. (1990) Relational Grammar. London: Routledge. P 158.6 B54 Bresnan, Joan (1995) Linear Order, Syntactic Rank, and Empty Categories: On Weak Crossover. Mary Dalrymple, Ronald M. Kaplan, John T. Maxwell III, and Annie Zaenen, eds., Formal Issues in Lexical-Functional Grammar, pp. 241 274. Stanford, Calif.: CSLI Publications. P 158.25 F67 Bresnan, Joan (2001) Lexical-Functional Syntax. Oxford: Blackwell. on reserve: P 291 B74 2000 Dalrymple, Mary (2001) Syntax and Semantics, Vol 34: Lexical-Functional Grammar. New York; Academic Press. Dalrymple, Mary, Ronald M. Kaplan, and Tracy Holloway King (2001) Weak Crossover and the Absence of Traces. in Miriam Butt and Tracy Holloway King, eds., Proceedings of the LFG01 Conference, University of Hong Kong, pp. 66 82. On-line: CSLI Publications. http://cslipublications.stanford.edu/lfg/6/lfg01.html Dalrymple, Mary, and Tracy Holloway King (2000) Missing-Object Constructions: Lexical and Constructional Variation. in Miriam Butt and Tracy Holloway King, eds., Proceedings of the LFG 00 Conference, University of California, Berkeley, pp. 82 103. On-line: CSLI Publications. http://cslipublications.stanford.edu/lfg/5/lfg00.html

A Formal Account, p. 10 Falk, Yehuda N. (1983) Subjects and Long Distance Dependencies. Linguistic Analysis 12: 245 270. Falk, Yehuda N. (2000) Pivots and the Theory of Grammatical Functions. in Miriam Butt and racy Holloway King, eds., Proceedings of the LFG00 Conference, University of California, Berkeley, pp. 122 138. On-line: CSLI Publications. http://cslipublications.stanford.edu/lfg/5/lfg00.html Falk, Yehuda N. (2001) Lexical-Functional Grammar: An Introduction to Parallel Constraint-Based Syntax. Stanford, Calif.: CSLI Publications. P 158.25 F35 2001 Kaplan, Ronald M., and Joan Bresnan (1982) Lexical-Functional Grammar: A Formal System for Grammatical Representation. in Joan Bresnan, ed., The Mental Representation of Grammatical Relations, pp. 173 281. Cambridge, Mass.: MIT Press. P158.6 M46 Kaplan, Ronald M., and Annie Zaenen (1989) Long-Distance Dependencies, Constituent Structure, and Functional Uncertainty. in Mark R. Baltin and Anthony S. Kroch, eds., Alternative Conceptions of Phrase Structure, pp. 17 42. Chicago: University of Chicago Press. P 158.3 A48