Generative Grammar Assignment
Generative Grammar Assignment
Generative Grammar:
Generative grammar refers to a particular approach to the study of syntax. It attempts to give a
set of rules that will correctly predict which combinations of words will form grammatical
sentences.
Example:
The cat ate the mouse
NP
VP
NP
The
cat
Transformational
ate the
mouse
Grammar
related
to
Generative
grammar:
Transformational Grammar is looked upon as one of the approach to generative grammar which
describes a language with the help of transformational rules. It involves logical reasoning to
understand fully the meaning of the selected words. As such transformational grammar goes a
step ahead of structural grammar which focuses more on the sentence structures used for
communication. Apart from the use of correct sentence structure, transformational grammar
analyses the words with reference to its underlying thoughts. Transformational grammar employs
most of the linguistic tools such as syntax and context to explore the possible meanings of words.
Standard theory(1957-1965)
Extended Standard Theory(1965-1973)
Revised Extended Standard Theory(1973-1976)
Relational Grammar(1975-1990)
Government and Binding Principles
Minimalist Program(1990-Present)
(Deep Structure)
Syntactic constraints
Generalized phrase structures (X-bar theory)
linguistics, Relational
Grammar (RG)
is
syntactic
theory
which
argues
that
primitive grammatical relations provide the ideal means to state syntactic rules in universal terms
An alternative model of syntax based on the idea that notions like Subject, Direct Object, and
Indirect Object play a primary role in grammar.
In Relational Grammar, constituents that serve as the arguments to predicates are numbered. This
numbering system corresponds loosely to the notions of subject, direct object and indirect object.
The numbering scheme is (1)-subject, (2)- direct object, (3)- indirect object.
Example:
John gave Marry a kiss.
S
IO
DO
It is based on the principles and parameters theory, which states that there is a finite set of
fundamental principles common to all natural languages and a finite set of binary
Context-Free Grammar:
A context-free grammar is a set of recursive rewriting rules used to generate patterns of strings.
Example
The dog ate the bone.
S
NP
VP
D
The
dog
ate the
N
bone
This grammar will generate well-formed syntactic structure (e.g. sentence) of the
language.
This grammar will have a finite number of rules but will be capable of generating an
curriculum.
It means that it is not applicable to language teaching.
The first reason is that the explication of the theory is directed more towards linguists,