Models of Generative Grammar. Generative Grammar. A Generative Grammar is a set of formal rules that can generate an infinite set of sentences that constitute the language as a whole. Chomsky insisted that a grammar -
Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author.While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server.
Models of Generative Grammar
Chomsky insisted that a grammar -
Chomsky reviewed the two conceptions of grammar (1957):
Suppose we have a machine –
Representing Grammar/machine that produces just
the two sentences – “the man comes” and “the man
S -> NP VP
NP -> Det N
VP -> V NP
VP -> V
Det -> a
Det -> the
N -> woman
N -> man
V -> shoots
It contains three types of symbol:
As only single non-terminals occur on the left side of the rules.
Consider the string of words – a woman shoots a man.
The following tree answers both the questions:
Such a tree is called a parse tree, and it gives us two sorts of
1. Information about strings 2. Information about structure
NP VP VP NP
N V V N
Mistrust wounds Mistrust wounds
An example of a PSG (associated with constituent analysis) :
Det N Verb NP
The man hit the ball
Although Chomsky found phrase-structure grammar to be necessary, he
argued that this was not sufficient.
2. It over-generates. It blindly allows many sentences as grammatical which are in fact ungrammatical e.g.