You are on page 1of 17

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

NP VP

Pron
Aux V NP

I can solve Det N

the problem
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.

NPi NP VP

Det N Pron
Aux V NP
this problem
I can solve t(race)i
Topicalization
 To John, Mary gave the book.
S

PPi NP VP

P NP
N V NP PP
N
Det N t(race)i

to John Mary gave the book


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.

[NPThis problem]i , I believe [S’ that [S I can solve [NP t ]i ] ]

 I believe that this problem I can solve.

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

NP VP

N
Aux V NP

John can solve Det N

this problem
Wh-movement
 [Which problem]i can John solve ti ?
S`

Comp S

Aux NP VP
NPi
N
Wh-Det N V NP

which problem can John solve t(race)i


Relative Pronoun Movement
 John heard the claim which Bill made.
S

NP VP

N V NP

Det N S`
John heard
the claimi …
Relative Pronoun Movement
 the claim whichi Bill made ti.
NP
Det S`
N
Comp S
the claimi
NPi NP VP

Wh-NP N V NP

which Bill made t(race)i


Relative Pronoun Movement
 [The problemi thati he solved ti was easy].
S

NP VP
S`
V AP
Det N Comp S
A
NP NP VP was

Rel-Pron Pron V NP easy

the problemi thati he solved 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.

You might also like