18. Transformational mechanism of analyzing sentences.
T. G. approached in the 50th century by N. Chomsky, Z. Herris
T. G. the main idea: any language is not so complicated as it looks on the surface. Any language
Contains a small number of kernel sentences and all others sentences are
Called transforms of the kernel once and they are derived or generated from this kernel sentences with the help of derivation rules.
Problems: two main problems: 1) the establishment of this kernel sentences
2) the establishment of this transformational rules
All transformational mechanism consists of three big levels, there are: 1) Transformation in
Simple sentences
2) Transformation in composite sentences
3) Transformation of nomination
Example: He studies English -------- His studying
The scheme of T. M.
S
NP
S S
The works of the machine the machine does work
The machine`s work Does the machine work?
The machine work What works?
The working machine the machine doesn’t work
For the machine to work the machine didn’t work
The machine working
The machine works
S1 + S2 + S3
The machine works and hums
When the machine works it hums
Working, the machine hums
When working the machine hums
I like when the machine works
If the machine worked!
T. is a rule which allows us to perform a certain change in the kernel sentence. It retains the grammatical and semantic relations of the kernel sentence.
The T. sentences
Ядерные предложения
Ben ran
NVN: Ben sees John
NVprN: Ben looks at John
NisA: Ben is handsome
NisN: ben is a student
NisD: Ben is out
NisprepN: Ben is in the garden
Composite sentence via transformational modal
S1 + S2 __ Compound S3
Example: S1: The man came to the window +___ The man came to the window, and the
S2: The detective saw him detective saw him
S1: We asked for his slides +__ we asked for his slides and he showed us them
S2: He showed us his slides
Complex sentence: S1: He picked up a flower +___ He picked up the flower which had dropped
S2: the flower had dropped