See Chomsky Normal Form on Wiktionary
Download JSON data for Chomsky Normal Form meaning in All languages combined (4.1kB)
{
"etymology_text": "Named after Noam Chomsky (b. 1928), American linguist and philosopher, who first described it.",
"head_templates": [
{
"args": {
"1": "-",
"head": "Chomsky Normal Form"
},
"expansion": "Chomsky Normal Form (uncountable)",
"name": "en-noun"
}
],
"lang": "English",
"lang_code": "en",
"pos": "noun",
"senses": [
{
"categories": [
{
"kind": "topical",
"langcode": "en",
"name": "Theory of computing",
"orig": "en:Theory of computing",
"parents": [
"Computer science",
"Computing",
"Sciences",
"Technology",
"All topics",
"Fundamental"
],
"source": "w"
},
{
"_dis": "48 52",
"kind": "other",
"name": "English entries with incorrect language header",
"parents": [
"Entries with incorrect language header",
"Entry maintenance"
],
"source": "w+disamb"
},
{
"_dis": "48 52",
"kind": "other",
"name": "English entries with language name categories using raw markup",
"parents": [
"Entries with language name categories using raw markup",
"Entry maintenance"
],
"source": "w+disamb"
},
{
"_dis": "47 53",
"kind": "other",
"name": "English terms with non-redundant non-automated sortkeys",
"parents": [
"Terms with non-redundant non-automated sortkeys",
"Entry maintenance"
],
"source": "w+disamb"
}
],
"examples": [
{
"text": "Any ε-free Context Free Grammar can be converted (through an algorithm) into one in Chomsky Normal Form, and there is an algorithm that can parse formulas in the language of such a grammar in polynomial time; it is called the CYK algorithm."
}
],
"glosses": [
"A context-free grammar in which the right hand side of any production rule consists of either one terminal symbol or two non-terminal symbols."
],
"id": "en-Chomsky_Normal_Form-en-noun-LqxbGy~M",
"links": [
[
"computing",
"computing#Noun"
],
[
"theory",
"theory"
],
[
"context-free grammar",
"context-free grammar"
]
],
"raw_glosses": [
"(computing theory) A context-free grammar in which the right hand side of any production rule consists of either one terminal symbol or two non-terminal symbols."
],
"tags": [
"uncountable"
],
"topics": [
"computing",
"computing-theory",
"engineering",
"mathematics",
"natural-sciences",
"physical-sciences",
"sciences"
]
},
{
"categories": [
{
"kind": "topical",
"langcode": "en",
"name": "Theory of computing",
"orig": "en:Theory of computing",
"parents": [
"Computer science",
"Computing",
"Sciences",
"Technology",
"All topics",
"Fundamental"
],
"source": "w"
},
{
"_dis": "48 52",
"kind": "other",
"name": "English entries with incorrect language header",
"parents": [
"Entries with incorrect language header",
"Entry maintenance"
],
"source": "w+disamb"
},
{
"_dis": "48 52",
"kind": "other",
"name": "English entries with language name categories using raw markup",
"parents": [
"Entries with language name categories using raw markup",
"Entry maintenance"
],
"source": "w+disamb"
},
{
"_dis": "47 53",
"kind": "other",
"name": "English terms with non-redundant non-automated sortkeys",
"parents": [
"Terms with non-redundant non-automated sortkeys",
"Entry maintenance"
],
"source": "w+disamb"
}
],
"glosses": [
"A context-free grammar in which the right hand side of any production rule consists of either one terminal symbol or two non-terminal symbols (neither of which is the start symbol) or the epsilon (i.e. null string) symbol, but only if the left hand side is the start symbol. (Note: this is the full-fledged version, whereas the previous definition may be said to be defining Chomsky reduced form.)"
],
"id": "en-Chomsky_Normal_Form-en-noun-crW~bxPh",
"links": [
[
"computing",
"computing#Noun"
],
[
"theory",
"theory"
]
],
"raw_glosses": [
"(computing theory) A context-free grammar in which the right hand side of any production rule consists of either one terminal symbol or two non-terminal symbols (neither of which is the start symbol) or the epsilon (i.e. null string) symbol, but only if the left hand side is the start symbol. (Note: this is the full-fledged version, whereas the previous definition may be said to be defining Chomsky reduced form.)"
],
"tags": [
"uncountable"
],
"topics": [
"computing",
"computing-theory",
"engineering",
"mathematics",
"natural-sciences",
"physical-sciences",
"sciences"
]
}
],
"wikipedia": [
"Chomsky Normal Form",
"Noam Chomsky"
],
"word": "Chomsky Normal Form"
}
{
"categories": [
"English entries with incorrect language header",
"English entries with language name categories using raw markup",
"English eponyms",
"English lemmas",
"English multiword terms",
"English nouns",
"English terms with non-redundant non-automated sortkeys",
"English uncountable nouns"
],
"etymology_text": "Named after Noam Chomsky (b. 1928), American linguist and philosopher, who first described it.",
"head_templates": [
{
"args": {
"1": "-",
"head": "Chomsky Normal Form"
},
"expansion": "Chomsky Normal Form (uncountable)",
"name": "en-noun"
}
],
"lang": "English",
"lang_code": "en",
"pos": "noun",
"senses": [
{
"categories": [
"en:Theory of computing"
],
"examples": [
{
"text": "Any ε-free Context Free Grammar can be converted (through an algorithm) into one in Chomsky Normal Form, and there is an algorithm that can parse formulas in the language of such a grammar in polynomial time; it is called the CYK algorithm."
}
],
"glosses": [
"A context-free grammar in which the right hand side of any production rule consists of either one terminal symbol or two non-terminal symbols."
],
"links": [
[
"computing",
"computing#Noun"
],
[
"theory",
"theory"
],
[
"context-free grammar",
"context-free grammar"
]
],
"raw_glosses": [
"(computing theory) A context-free grammar in which the right hand side of any production rule consists of either one terminal symbol or two non-terminal symbols."
],
"tags": [
"uncountable"
],
"topics": [
"computing",
"computing-theory",
"engineering",
"mathematics",
"natural-sciences",
"physical-sciences",
"sciences"
]
},
{
"categories": [
"en:Theory of computing"
],
"glosses": [
"A context-free grammar in which the right hand side of any production rule consists of either one terminal symbol or two non-terminal symbols (neither of which is the start symbol) or the epsilon (i.e. null string) symbol, but only if the left hand side is the start symbol. (Note: this is the full-fledged version, whereas the previous definition may be said to be defining Chomsky reduced form.)"
],
"links": [
[
"computing",
"computing#Noun"
],
[
"theory",
"theory"
]
],
"raw_glosses": [
"(computing theory) A context-free grammar in which the right hand side of any production rule consists of either one terminal symbol or two non-terminal symbols (neither of which is the start symbol) or the epsilon (i.e. null string) symbol, but only if the left hand side is the start symbol. (Note: this is the full-fledged version, whereas the previous definition may be said to be defining Chomsky reduced form.)"
],
"tags": [
"uncountable"
],
"topics": [
"computing",
"computing-theory",
"engineering",
"mathematics",
"natural-sciences",
"physical-sciences",
"sciences"
]
}
],
"wikipedia": [
"Chomsky Normal Form",
"Noam Chomsky"
],
"word": "Chomsky Normal Form"
}
This page is a part of the kaikki.org machine-readable All languages combined dictionary. This dictionary is based on structured data extracted on 2024-05-20 from the enwiktionary dump dated 2024-05-02 using wiktextract (1d5a7d1 and 304864d). The data shown on this site has been post-processed and various details (e.g., extra categories) removed, some information disambiguated, and additional data merged from other sources. See the raw data download page for the unprocessed wiktextract data.
If you use this data in academic research, please cite Tatu Ylonen: Wiktextract: Wiktionary as Machine-Readable Structured Data, Proceedings of the 13th Conference on Language Resources and Evaluation (LREC), pp. 1317-1325, Marseille, 20-25 June 2022. Linking to the relevant page(s) under https://kaikki.org would also be greatly appreciated.