Chomsky hierarchy
E644
concept in formal language theory
concept in theoretical computer science
formal language classification scheme
hierarchy of formal grammars
The Chomsky hierarchy is a classification of formal grammars into four types that correspond to increasing levels of generative power and computational complexity in formal language theory.
All labels observed (3)
| Label | Occurrences |
|---|---|
| Chomsky hierarchy canonical | 5 |
| Chomsky–Schützenberger hierarchy | 1 |
| formal language theory | 1 |
How this entity was disambiguated
This entity first appeared as the object of triple T16429 — resolving that mention is where its identity was fixed. The disambiguator weighed these candidate entities and picked the highlighted one (or “None”, minting a new entity). This is how homonymy is resolved: the same surface form can point to different entities.
NED1
Entity disambiguation (via context triple)
gpt-5-mini-2025-08-07
Target entity: Chomsky hierarchy Context triple: [Noam Chomsky, knownFor, Chomsky hierarchy]
-
A.
Differential analyzer
The Differential Analyzer is an early analog mechanical computer designed to solve differential equations using interconnected rotating shafts and wheels.
-
B.
Man-Computer Symbiosis
Man-Computer Symbiosis is a seminal 1960 essay by J. C. R. Licklider that envisioned interactive, cooperative partnerships between humans and computers, laying conceptual foundations for modern interactive computing and the internet.
-
C.
Bolt Beranek and Newman
Bolt Beranek and Newman was a pioneering American research and engineering firm best known for its foundational role in developing the ARPANET, a precursor to the modern internet.
-
D.
Literary Machines
Literary Machines is a seminal book by Theodor Nelson that outlines his visionary concepts for hypertext, non-linear writing, and the structure of digital information systems.
-
E.
Noam Chomsky
Noam Chomsky is an American linguist, philosopher, cognitive scientist, historian, and political activist widely regarded as the founder of modern linguistics and a prominent critic of U.S. foreign policy.
- F. None of above. chosen
- G. Unsure - the case is ambiguous/there is not enough information to decide.
NED2
Entity disambiguation (via description)
gpt-5-mini-2025-08-07
Target entity: Chomsky hierarchy Target entity description: The Chomsky hierarchy is a classification of formal grammars into four types that correspond to increasing levels of generative power and computational complexity in formal language theory.
-
A.
Differential analyzer
The Differential Analyzer is an early analog mechanical computer designed to solve differential equations using interconnected rotating shafts and wheels.
-
B.
Man-Computer Symbiosis
Man-Computer Symbiosis is a seminal 1960 essay by J. C. R. Licklider that envisioned interactive, cooperative partnerships between humans and computers, laying conceptual foundations for modern interactive computing and the internet.
-
C.
Bolt Beranek and Newman
Bolt Beranek and Newman was a pioneering American research and engineering firm best known for its foundational role in developing the ARPANET, a precursor to the modern internet.
-
D.
Literary Machines
Literary Machines is a seminal book by Theodor Nelson that outlines his visionary concepts for hypertext, non-linear writing, and the structure of digital information systems.
-
E.
Noam Chomsky
Noam Chomsky is an American linguist, philosopher, cognitive scientist, historian, and political activist widely regarded as the founder of modern linguistics and a prominent critic of U.S. foreign policy.
- F. None of above. chosen
Statements (46)
| Predicate | Object |
|---|---|
| instanceOf |
concept in formal language theory
ⓘ
concept in theoretical computer science ⓘ formal language classification scheme ⓘ hierarchy of formal grammars ⓘ |
| alternativeName |
Chomsky–Schützenberger hierarchy
ⓘ
linked to:
Chomsky hierarchy
|
| assumes | grammars generate formal languages ⓘ |
| characterizes | constraints on grammar production rules ⓘ |
| correspondsToAutomatonModel |
Turing machine
ⓘ
finite automaton ⓘ linear bounded automaton ⓘ pushdown automaton ⓘ |
| correspondsToLanguageClass |
context-free languages
ⓘ
context-sensitive languages ⓘ recursively enumerable languages ⓘ regular languages ⓘ |
| definesOrderingOf | formal grammar types ⓘ |
| field |
automata theory
ⓘ
formal language theory ⓘ mathematical linguistics ⓘ theoretical computer science ⓘ |
| hasLevel |
Type-0 grammar
ⓘ
Type-1 grammar ⓘ Type-2 grammar ⓘ Type-3 grammar ⓘ |
| hasLevelCount | 4 ⓘ |
| hasTopLevel | Type-0 grammar ⓘ |
| hasTypeName |
Type-0
ⓘ
Type-1 ⓘ Type-2 ⓘ Type-3 ⓘ |
| impliesInclusion |
context-free languages are a subset of context-sensitive languages
ⓘ
context-sensitive languages are a subset of recursively enumerable languages ⓘ regular languages are a subset of context-free languages ⓘ |
| introducedBy | Noam Chomsky ⓘ |
| introducedInContext | generative grammar ⓘ |
| namedAfter | Noam Chomsky ⓘ |
| ordersBy |
computational complexity
ⓘ
generative power ⓘ |
| relatesConcept |
automaton
ⓘ
formal grammar ⓘ formal language ⓘ language recognition power ⓘ |
| usedIn |
analysis of natural language syntax
ⓘ
classification of programming language grammars ⓘ complexity analysis of language recognition ⓘ design of parsers ⓘ |
How these facts were elicited
The pipeline generated the facts above by prompting gpt-5.1 with this entity's name + description and the instruction below.
Instruction
You are a knowledge base construction expert. Given a subject entity and a description of it, return factual statements that you know for the subject as a JSON list of dictionaries(triples), where keys must be "subject", "predicate" and "object". The number of facts may be very high, between 25 to 50 or more, for very popular subjects. For less popular subjects, the number of facts can be very low, like 5 or 10. # Requirements - If you don't know the subject at all, return an empty list. - If the subject is not a named entity, return an empty list. - Include at least one triple where predicate is "instanceOf". - Do not get too wordy. - Separate several objects into multiple triples with one object.
Input
Subject: Chomsky hierarchy Description of subject: The Chomsky hierarchy is a classification of formal grammars into four types that correspond to increasing levels of generative power and computational complexity in formal language theory.
Referenced by (7)
Full triples — surface form annotated when it differs from this entity's canonical label.
linked to: Chomsky hierarchy
linked to: Chomsky hierarchy
subject linked to:
"Introduction to Automata Theory, Languages, and Computation"
subject linked to:
Formal Language Theory