Transformational Grammar

Introduction to

Transformational Grammar

Rajat Kumar Mohanty rkm@cse.iitb.ac.in

Department of Computer Science and Engineering Indian Institute of Technology Bombay

Types of Generative Grammar

 Finite State Model

(sequential)

 Phrase Structure Model

(sequential + hierarchical) + (categorial)

 Transformational Model

(sequential + hierarchical + transformational) + (categorial + functional)

Transformational Model

 If a generative grammar makes use of all the three

 Sequential

 Hierarchical

 Transformational breaking up and two

 categorial

 Functional

labeling is called a Transformational Grammar.

Transformations: Phrasal Categories

 Topicalization

 Topicalized NP

 Topicalized PP

 Movement

 Wh-movement

 Wh-questions

 Relatives

 NP-movement

 Extraposition and Heavy NP Shift

Topicalization

 I can solve this problem.

 I can solve *(this problem).

 *I solved.

 This problem, I can solve.

S

VP

Aux NP

can Det N

V solve

the problem

NP

I Pron

Topicalization

 Subcategorization Frame

 solve: [V; _NP]

 PS Rules

S  NP VP

VP  Aux V NP

Aux  can

V  solve / [ _NP]

NP  Pron | Det N

Pron  I

Det the

N  problem

Topicalization

 This problem, I can solve.

S NP VP

I

Aux NP

can t(race)_i V

solve NP_i

Det N

this problem

Pron

Topicalization

 To John, Mary gave the book.

S NP VP

Mary

V

gave PP_i

P

to John

NP N

PP t(race)_i NP

Det N

the book

N

Topicalization

 Fix the car, I wonder whether John will.

[_VP Fix the car]_i , I wonder [_S’ whether [_S he will [_VP t]_i ]]

Topicalization

 This problem, I believe that I can solve.

 I believe that this problem I can solve.

[_NPThis problem]_i , I believe [_S’ that [_S I can solve [_NP t ]_i ] ]

I believe [_S’ that [_S [_NP this problem ]_i I can solve [_NP t ]_i ] ]

Topicalization

 I want this novel to be considered for a prize.

 This novel, I want to be considered for a prize.

[_NPThis novel]_i , I want [_NP t ]_i to be considered for a prize

Wh-movement

 John can solve this problem.

 Which problem can John solve?

S

VP

Aux NP

can Det N

V solve

this problem NP

John N

Wh-movement

 [Which problem]_i can John solve t_i ?

S NP VP

John Aux

NP

can t(race)_i

V solve NP_i

Wh-Det N

which problem

N Comp

S`

Relative Pronoun Movement

 John heard the claim which Bill made.

S

VP

V NP

heard Det N S`

the claim_i NP

N

… John

Relative Pronoun Movement

 the claim which_i Bill made ti.

S`

S

NP VP

N V NP

made t(race)_i Comp

Wh-NP NP_i

which Bill

NP

Det N

the claim_i

Relative Pronoun Movement

 [The problem_i that_i he solved t_i was easy].

S`

S

NP VP

Pron V NP

solved Comp

Rel-Pron NP

that_i he

S

NP VP

V AP

was

easy

Det N

the problem_i

A

t(race)_i

Suggested Readings

 [Chomsky, 1981] Noam Chomsky: Lectures on Government and Binding. Foris, Dordrecht.

 [Lyons, 1977] John Lyons: Chomsky. Fontana, London.

 [Mohanan, 1988] K. P. Mohanan: Introduction to Linguistics (Part-2). CIEFL, Hyderabad.

 [Ouhalla, 1999] Jamal Ouhalla: Introducing Transformational Grammar. Arnold, London.

 [Radford, 1988] Andrew Radford: Transformational Grammar.

Cambridge University Press, Cambridge.

 [Ray, 1995] Tapas S. Ray: Introduction to Linguistics (Block-III).

CIEFL, Hyderabad.