Journal of the ACM · 1966 · 782 citations · 2 references
ComputingComputer ScienceMathematicsComputational LinguisticsNatural Language ProcessingSyntaxAutomata TheoryContext-free LanguagesFinite AutomataFormal LanguagesGrammarSentence StructureChomsky HierarchyContext-free GrammarsFinite Automata TheoryGrammar FormalismsGrammar TheoryGrammatical AmbiguityGrammatical StructureLinear Context-free Grammar
In this report, certain properties of context-free (CF or type 2) grammars are investigated, like that of Chomsky. In particular, questions regarding structure, possible ambiguity and relationship to finite automata are considered. The following results are presented: The language generated by a context-free grammmar is linear in a sense that is defined precisely. The requirement of unambiguity—that every sentence has a unique phrase structure—weakens the grammar in the sense that there exists a CF language that cannot be generated unambiguously by a CF grammar. The result that not every CF language is a finite automaton (FA) language is improved in the following way. There exists a CF language L such that for any L′ ⊆ L , if L′ is FA, an L″ ⊆ L can be found such that L″ is also FA, L′ ⊆ L″ and L″ contains infinitely many sentences not in L′ . A type of grammar is defined that is intermediate between type 1 and type 2 grammars. It is shown that this type of grammar is essentially stronger than type 2 grammars and has the advantage over type 1 grammars that the phrase structure of a grammatical sentence is unique, once the derivation is given.
2
Three models for the description of language
Noam Chomsky · IEEE Transactions on Information Theory · 1956 · 2.8K citations
On certain formal properties of grammars
Noam Chomsky · Information and Control · 1959 · 1.6K citations