Control and Tough- Movement

Similar documents
Control and Tough- Movement

HPSG: Binding Theory

Computationele grammatica

Some binding facts. Binding in HPSG. The three basic principles. Binding theory of Chomsky

HPSG II: the plot thickens

Introduction to Semantics. The Formalization of Meaning 1

Analyzing Extraction. N.B.: Each type has its own set of variables (Church typing).

Introduction to Semantics. Common Nouns and Adjectives in Predicate Position 1

CS460/626 : Natural Language Processing/Speech, NLP and the Web

Time Zones - KET Grammar

CAS LX 522 Syntax I Fall 2000 October 10, 2000 Week 5: Case Theory and θ Theory. θ-theory continued

Proseminar on Semantic Theory Fall 2013 Ling 720 The Proper Treatment of Quantification in Ordinary English, Part 1: The Fragment of English

1. Background. Task: Determine whether a given string of words is a grammatical (well-formed) sentence of language L i or not.

(7) a. [ PP to John], Mary gave the book t [PP]. b. [ VP fix the car], I wonder whether she will t [VP].

Semantics and Generative Grammar. The Semantics of Adjectival Modification 1. (1) Our Current Assumptions Regarding Adjectives and Common Ns

X-bar theory. X-bar :

English Pronominal Affixes in Logical Grammar

Constituency. Doug Arnold

Spring 2018 Ling 620 Introduction to Semantics of Questions: Questions as Sets of Propositions (Hamblin 1973, Karttunen 1977)

Spring 2018 Ling 620 The Basics of Intensional Semantics, Part 1: The Motivation for Intensions and How to Formalize Them 1

1 Rules in a Feature Grammar

Raising and Passive. Jean Mark Gawron. Linguistics 522 San Diego State University

Proseminar on Semantic Theory Fall 2015 Ling 720 Adnominal Tenses Redux: Thomas (2014) Nominal Tense and Temporal Implicatures

Ch. 2: Phrase Structure Syntactic Structure (basic concepts) A tree diagram marks constituents hierarchically

The Semantics of Definite DPs 1. b. Argument Position: (i) [ A politician ] arrived from Washington. (ii) Joe likes [ the politician ].

Binding Theory Different types of NPs, constraints on their distribution

Parsing with Context-Free Grammars

THE DRAVIDIAN EXPERIENCER CONSTRUCTION AND THE ENGLISH SEEM CONSTRUCTION. K. A. Jayaseelan CIEFL, Hyderabad

Semantics Basics for Syntacticians

Examples: P: it is not the case that P. P Q: P or Q P Q: P implies Q (if P then Q) Typical formula:

Parsing with CFGs L445 / L545 / B659. Dept. of Linguistics, Indiana University Spring Parsing with CFGs. Direction of processing

Parsing with CFGs. Direction of processing. Top-down. Bottom-up. Left-corner parsing. Chart parsing CYK. Earley 1 / 46.

CAS LX 500 Topics in Linguistics: Questions Spring 2006 March 2, b: Prosody and Japanese wh-questions

Semantics 2 Part 1: Relative Clauses and Variables

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

Spring 2017 Ling 620 Eliminating Res-Movement : An Introduction to Concept Generators

Hardegree, Formal Semantics, Handout of 8

Introduction to Semantics. Pronouns and Variable Assignments. We ve seen that implicatures are crucially related to context.

Hedging Your Ifs and Vice Versa

Simpler Syntax. Ling : Sign-Based Construction Grammar Instructor: Ivan A. Sag URL:

Other types of Movement

Semantics and Generative Grammar. A Little Bit on Adverbs and Events

Spring 2017 Ling 620 The Semantics of Control Infinitives: A First Introduction to De Se Attitudes

Lecture 7. Logic. Section1: Statement Logic.

Quantification: Quantifiers and the Rest of the Sentence

Mathematics 114L Spring 2018 D.A. Martin. Mathematical Logic

Against generalized quantifiers (and what to replace them with)

Generalized Quantifiers Logical and Linguistic Aspects

7.2. Generalizations and quantifiers Overview

CAS LX 522 Syntax I November 4, 2002 Week 9: Wh-movement, supplement

D2: For each type 1 quantifier Q, Q acc (R) = {a : Q(aR) = 1}.

Russell s logicism. Jeff Speaks. September 26, 2007

Sharpening the empirical claims of generative syntax through formalization

Context Free Grammars

Unterspezifikation in der Semantik Scope Semantics in Lexicalized Tree Adjoining Grammars

UC Berkeley, Philosophy 142, Spring 2016 John MacFarlane Philosophy 142

Ling 98a: The Meaning of Negation (Week 5)

Semantics and Generative Grammar. An Introduction to Intensional Semantics 1

CHAPTER THREE: RELATIONS AND FUNCTIONS

1 Propositional Logic

Chiastic Lambda-Calculi

INTRODUCTION TO LOGIC. Propositional Logic. Examples of syntactic claims

Spring 2017 Ling 620. An Introduction to the Semantics of Tense 1

Seminar in Semantics: Gradation & Modality Winter 2014

Philosophy of Mathematics Structuralism

INTRODUCTION TO LOGIC 4 The Syntax of Predicate Logic

Semantics and Generative Grammar. Pronouns and Variable Assignments 1. We ve seen that implicatures are crucially related to context.

First Order Logic (1A) Young W. Lim 11/18/13

Propositional Logic Review

3.8.1 Sum Individuals and Discourse Referents for Sum Individuals

Searle: Proper Names and Intentionality

Truth-Functional Logic

In this chapter, we specify a deductive apparatus for PL.

Two Reconstruction Puzzles Yael Sharvit University of Connecticut

The Importance of Being Formal. Martin Henz. February 5, Propositional Logic

INTENSIONS MARCUS KRACHT

Ling 5801: Lecture Notes 7 From Programs to Context-Free Grammars

Introduction to Metalogic

First Order Logic: Syntax and Semantics

On Strict Cyclicity and Label: Toward Elimination of Late Merge*

A Multi-Modal Combinatory Categorial Grammar. A MMCCG Analysis of Japanese Nonconstituent Clefting

Ling 130 Notes: Predicate Logic and Natural Deduction

Truth, Subderivations and the Liar. Why Should I Care about the Liar Sentence? Uses of the Truth Concept - (i) Disquotation.

Extensions to the Logic of All x are y: Verbs, Relative Clauses, and Only

The Lambek-Grishin calculus for unary connectives

The Formal Architecture of. Lexical-Functional Grammar. Ronald M. Kaplan and Mary Dalrymple

564 Lecture 25 Nov. 23, Continuing note on presuppositional vs. nonpresuppositional dets.

A Review of the Essentials of Extensional Semantics 1

Proseminar on Semantic Theory Fall 2010 Ling 720. Remko Scha (1981/1984): Distributive, Collective and Cumulative Quantification

Recap: Lexicalized PCFGs (Fall 2007): Lecture 5 Parsing and Syntax III. Recap: Charniak s Model. Recap: Adding Head Words/Tags to Trees

Propositional Logic. Testing, Quality Assurance, and Maintenance Winter Prof. Arie Gurfinkel

INTRODUCTION TO LOGIC

Intensionality. 1. Intensional Propositional Logic (IntPL).

Presuppositions (introductory comments)

CS1800: Strong Induction. Professor Kevin Gold

Parsing. Based on presentations from Chris Manning s course on Statistical Parsing (Stanford)

Logic Background (1A) Young W. Lim 12/14/15

Propositional Logic: Syntax

Scope Ambiguities through the Mirror

2 A 3-Person Discrete Envy-Free Protocol

Transcription:

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 (and so dummy subjects are disallowed). If such an expression is the complement of a RTO verb, then the PRO is identified with the upstairs Acc object (here indicated informally by subscripts) [consider her 1 [PRO 1 conservative]] a finite RTS verb, then the PRO is identified with the upstairs Nom subject [he 1 seems [PRO 1 conservative]] a nonfinite RTS verb or predicative, then the PRO is identified with the upstairs PRO subject. [PRO 1 be [PRO 1 conservative]] In all these cases, the upstairs object or subject identified with the PRO complement subject plays no semantic role with respect to the upstairs verbal/predicative. Control (2/5) But expressions with a PRO subject requirement are not always complements of raising verbs. For example, they can themselves be subjects, as in to err is human. Here the property of being human is being predicated of another property, the property of erring. Such expressions can also be complements of a verb (or predicative), which (in a sense to be made precise) identifies the unrealized downstairs subject semantically with one of its own arguments (either the subject or the object) which does play a semantic role upstairs. 1

Control (3/5) Examples: 1. Chiquita tried to sing. 2. Pedro persuaded Chiquita to sing. Verbs like these are often analyzed as describing a relation between one or two entities and a proposition about one of those entities (in the examples above, the proposition about Chiquita that she sings). That entity (here, Chiquita), or the corresponding upstairs argument position (subject of tried or object of persuaded), is said to control the PRO subject of the complement. In such cases the higher verb is called a control verb (and likewise for predicatives). Control (4/5) Control verbs are also called equi verbs because in early TG they were analyzed by a transformation ( equi-np deletion ) that deleted the complement subject (which was assumed to be identical with the controller). By comparsion, raising verbs in TG were analyzed by a different transformation ( raising ) that moved the complement subject to a higher position in the tree. Control (5/5) In LG, the analysis of control makes no tectogrammatical connection between the complement subject and the controller, instead handling the connection semantically: λ st.s tries t; Nom (PRO Inf) S; λ xp.try x (P x) λ stu.s persuaded t u; Nom Acc (PRO Inf) S; λ xyp.persuade x y (P y) Alternatively, control verb meanings can be treated as relations between one or two entities and a property: λ st.s tries t; Nom (PRO Inf) S; λ xp.try x P λ stu.s persuaded t u; Nom Acc (PRO Inf) S; λ xyp.persuade x y P with the relationship between the controller the property captured via nonlogical axioms ( meaning postulates ) of the semantic theory. 2

Tough-Movement (1/2) Paradigms like the following have troubled generative grammarians since the mid 1960s: a. It is easy (for Mary) to please John. b. John i is easy (for Mary) to please t i. The two sentences mean the same thing: that pleasing John is something that one (or Mary) has an easy time doing. It s the (b) version that has been troublesome, because the object of the infinitive, indicated by t, seems to have moved to the subject position of the finite sentence. But the syntactic relationship, indicated by coindexation, between the object trace and the subject doesn t fall straightforwardly under recognized rule types in the mainstream generative grammar tradition. Tough-Movement (2/2) As expressed by Hicks (2009), citing Holmberg (2000): Within previous principles-and-parameters models, TCs [tough constructions] have remained unexplained and in principle unexplainable because of incompatability with constraints on θ-role assignment, locality, and Case. Hicks, building on a notion of smuggling introduced by Collins (2005), proposes a phase-based minimalist analysis in terms of A-moving a constituent out of a complex null operator that has already undergone Ā- movement. GB Theory s Empty Categories (1/2) GB (earky 1980 s) posited four kinds of EC s (little) pro, essentially inuadible definite pronouns, not relevant for the present discussion trace (aka syntactic variable ) NP-trace (big) PRO These last three figured, respectively, in the analysis of: wh-movement, later subsumed under Ā-movement (wh-questions, relative clauses, topicalization, clefts, pseudoclefts, etc.) NP-movement, later called A-movement (passive, raising) control 3

GB Theory s Empty Categories (2/2) The theoretical assunptions about how these three kinds of empty elements worked never seemed to add up to a consistent story about TCs. In LG we have counterparts of all three. In due course we ll see how LG fares in accounting for TCs. First a glance at how the GB EC s were supposed to work. Wh-Movement/Ā-Movement Something moves, possibly long-distance, from a Case-assigned, θ-role-assigned A-position to an Ā position: 1. Who i [t i came]? 2. Who i did [Mary see t i ]? 3. Who i did [Mary say [John saw t i ]]? (long-distance) 4. Who i [t i rained]? (launch site is non-θ) 5. Who i did [John try [t i to come]]? (launch site is non-case) 6. Mary told John i [she liked t i ]. (landing site is an A-position) A = argument (subject or object) Ā = nonargument [... ] = sentence boundary NP-Movement/A-Movement Something moves from a non-case, A-position to a superjacent, non-θ, A- position: 1. John i seems [n i to be happy]. 2. It i seems [n i to be raining]. 3. John i seems [n i is happy]. (launch site is Case-assigned) 4. John i seems [Mary believes [n i to be happy]]. (landing site is not superjacent) 5. It i tries [n i to be raining]. (landing site is θ-assigned) 6. Who i does [John seem [n i to be happy]]? (landing site is an Ā-position) 4

Control An EC in a θ-assigned non-case position is anaphoric to something in a superjacent A-position: 1. Mary i tries [PRO i to be happy]. 2. Mary i /it i tries [PRO i to rain]. (EC is in a non-θ position.) 3. John tries [Mary to like PRO i ]. (EC is in a Case position) 4. Mary i tries [John believes [PRO i to be happy]]. (landing site is not superjacent) 5. Who i did [John try [PRO i to be happy]]? (landing site is an Ā-position) What s Tough about Tough- Movement Like Ā-movement, the launch site is a θ-assigned Case position, and it can be long-distance: a. John i is easy for Mary [to please t i ]. b. John i is easy for Mary [to get other people [to distrust t i ]]. Like A-movement, the landing site is a non-θ A-position. Like Control, the antecedent of the EC must be referential, i.e. it can t be a dummy or an idiom chunk: a. John is easy to believe to be incompetent. b. It is easy to believe to be raining. c. There is easy to believe to be a largest prime number. d. The shit is easy to believe to have hit the fan. (no idiomatic interpretation) Basic Tectos Involved in Analysis of TCs (1/2) Nom (nominative, e.g. he, she) Acc (accusative, e.g. him, her) For (nonpredicative for-phrase, e.g. for Mary) It ( dummy pronoun it) S (finite clause) Inf (infinitive clause) Bse (base clause) Prd (predicative clause) PrdA (adjectival predicative clause) 5

Basic Tectos Involved in Analysis of TCs (2/2) Neu (case-neutral, e.g. John, Mary) PRO (LG counterpart of GB s PRO) Used for subject of nonfinite verbs and predicatives that assign a semantic role to the subject, e.g. nonfinite please NP (LG counterpart of GB s NP-trace) Used for subject of nonfinite verbs and predicatives that don t assign a semantic role to the subject, e.g. nonfinite seem, infinitive to NOM (generalized nominatives) Used for subject of finite verbs that don t assign a semantic role to the subject, e.g. seems, is ACC (generalized accusatives) Used for objects of verbs that don t assign a semantic role to the object, e.g. infinite-complement-believe Review of Basic Tecto Ordering Neu < Nom Neu < Acc Nom < PRO Acc < PRO Nom < NOM Acc < ACC It < NOM It < ACC NOM < NP ACC < NP PRO < NP PrdA < Prd 6

Some Nonlogical Constants for Lexical Semantics j : e (John) m : e (Mary) rain : p please : p 2 (The first argument is pleasing and the second argument experiences the pleasure.) easy : e p 1 p (The first argument is the one who has an easy time of it, and the second argument is the piece of cake. Lexical Entries it; It; (dummy pronoun it) john; Neu; j mary; Neu; m λ st.s pleases t; Nom Acc S; please λ t.please t; Acc PRO Bse; λ yx.please x y λ t.to t; (A Bse) A Inf; λ P.P (A NP, P : B p) λ st.s is t; A (A Prd) S; λ xp.p x (A NOM, x : B, P : B p) λ t.for t; Acc For; λ x.x λ st.easy s t; For (PRO Inf) It PrdA; λ xpo.easy x P λ sf.easy s (f e); For (Acc PRO Inf) PRO PrdA; λ xry.easy x (r y) How Neutral Expressions Get Case john; Neu; j D1 λ st.s pleases t; Nom Acc S john; Nom; j λt.john pleases t; Acc S; please j john pleases mary; S; please j m mary; Neu; m mary; Acc; m D1 Nonpredicative Prepositional Phrases Here and henceforth, leaves with overbars were already proved as lemmas in earlier derivations. λ t.for t; Acc For; λ x.x mary; Acc; m for mary; For; m In the absence of clear empirical supportfor calling nonpredicative For-phrases prepositional, we just treat For as a basic tecto. 7

A Base Phrase λ t.please t; Acc PRO Bse; λ yx.please x y john; Acc; j please john; PRO Bse; λ x.please x j An Infinitive Phrase [1:] λ t.to t; (A Bse) A Inf; λ P.P to please john; PRO Inf; λx.please x j please john; PRO Bse; λx.please x j Here A (two occurrences) in the to schema was instantiated as PRO (and B in P : B p as e). This is legitimate because the schematization is over A NP, and in fact PRO NP. This is an instance of (the LG counterpart of ) Raising, in this case of PRO from the base-form complement please John to the infinite phrase. There is no sign of tectotype PRO that raises! An Impersonal Predicative Phrase [2]: λ st.easy s t; For (PRO Inf) It PrdA; λ xpo.easy x P for mary; For; m λ t.easy for mary t; (PRO Inf) It PrdA; λ Po.easy m [3:] [2] [1] easy for mary to please john; It PrdA; λo.easy m (λx.please x j) easy for mary to please john; It Prd; λo.easy m (λx.please x j) D3 This is just like a Control construction, e.g. Mary tries to please John, which means try m (λ x.please x j)... Except that the controller is the For-phrase, rather than the subject (which is only a dummy) This uses the semantics for Control where the infinitive complement is analyzed as a property rather than a proposition. It is easy for Mary to please John [4]: λ st.s is t; A (A Prd) S; λ xp.p x λ t.it is t; (It Prd) S; λ P.P it; It; [4] [3] it is easy for mary to please john; S; easy m (λx.please x j) Here A in is is instantiated as It (and B in x : B as T, so P : T p). This is another case of Raising, in this case of the unrealized It subject of easy for Mary to please John. In no sense was the sign it ever in the predicative phrase. 8

A Gappy Infinitive Phrase [5]: λ t.please t; Acc PRO Bse; λyx.please x y s; Acc; y s; Acc; y s; Acc; y please s; PRO Bse; λx.please x y [6:] λ t.to t; (A Bse) A Inf; λ P.P [5] s; Acc; y to please s; PRO Inf; λx.please x y λs.to please s; Acc PRO Inf; λyx.please x y HP The object trace, which is withdrawn in the last proof step, captures the sense in which Tough-Movement works like an Ā (long-distance) dependency. The λ s and λ y in the pheno and semantics of the conclusion are prefigured by the empty operator binding the trace in Chomsky s (1977) analysis of this same construction: [john i is easy O i [PRO to please t i ]] Unlike Hicks analysis, there is nothing complex about the operator that binds the trace (it is just λ), and no sense in which anything ever moves out of it. A Personal Predicative Phrase [7:] λ sf.easy s (f e); For (Acc InfP) PRO PrdA; λ xry.easy x (R y) for mary; For; m λ f.easy for mary (f e); (Acc InfP) PRO PrdA; λ Ry.easy m (R y) [8:] [7] [6] easy for mary to please; PRO PrdA; λy.easy m (λx.please x y) easy for mary to please; Nom PrdA; λy.easy m (λx.please x y) easy for mary to please; Nom Prd; λy.easy m (λx.please x y) D2 D3 Here InfP abbreviates PRO Inf. John is easy for Mary to please [9:] λ st.s is t; A (A Prd) S; λ xp.p x λ t.john is t; (Nom Prd) S; λ P.P j john; Nom; j [9] easy for mary to please; Nom Prd; λy.easy m (λx.please x y) John is easy for mary to please; S; easy m (λx.please x j) Here A in is is instantiated as Nom. This is another instance of Raising, in this case of the unrealized Nom subject of the predicative phrase easy for Mary to please to the sentence. But John was never actually in the predicative phrase! Tough-constructions are unproblematic for LG. 9