See nondeterministic on Wiktionary
{
"etymology_templates": [
{
"args": {
"1": "en",
"2": "non",
"3": "deterministic"
},
"expansion": "non- + deterministic",
"name": "prefix"
}
],
"etymology_text": "From non- + deterministic.",
"head_templates": [
{
"args": {
"1": "-"
},
"expansion": "nondeterministic (not comparable)",
"name": "en-adj"
}
],
"lang": "English",
"lang_code": "en",
"pos": "adj",
"senses": [
{
"categories": [
{
"kind": "other",
"name": "English entries with incorrect language header",
"parents": [
"Entries with incorrect language header",
"Entry maintenance"
],
"source": "w"
},
{
"kind": "other",
"name": "English terms prefixed with non-",
"parents": [],
"source": "w"
},
{
"kind": "other",
"name": "Entries with translation boxes",
"parents": [],
"source": "w"
},
{
"kind": "other",
"name": "Pages with 1 entry",
"parents": [],
"source": "w"
},
{
"kind": "other",
"name": "Pages with entries",
"parents": [],
"source": "w"
},
{
"kind": "other",
"name": "Terms with Czech translations",
"parents": [],
"source": "w"
},
{
"kind": "other",
"name": "Terms with Dutch translations",
"parents": [],
"source": "w"
},
{
"kind": "other",
"name": "Terms with Finnish translations",
"parents": [],
"source": "w"
},
{
"kind": "other",
"name": "Terms with French translations",
"parents": [],
"source": "w"
},
{
"kind": "other",
"name": "Terms with German translations",
"parents": [],
"source": "w"
},
{
"kind": "other",
"name": "Terms with Hungarian translations",
"parents": [],
"source": "w"
},
{
"kind": "other",
"name": "Terms with Icelandic translations",
"parents": [],
"source": "w"
},
{
"kind": "other",
"name": "Terms with Romanian translations",
"parents": [],
"source": "w"
},
{
"kind": "topical",
"langcode": "en",
"name": "Computer science",
"orig": "en:Computer science",
"parents": [
"Computing",
"Sciences",
"Technology",
"All topics",
"Fundamental"
],
"source": "w"
}
],
"derived": [
{
"word": "complementary nondeterministic polynomial"
},
{
"word": "nondeterministic polynomial time"
},
{
"word": "nondeterministic Turing machine"
},
{
"word": "NP"
}
],
"examples": [
{
"text": "Nondeterministic bottom-up tree automaton recognize the class of regular tree languages.",
"type": "example"
},
{
"ref": "2020, Mikhail Moshkov, Comparative Analysis of Deterministic and Nondeterministic Decision Trees, Springer Nature, →ISBN, page 1:",
"text": "The aim of this book is to compare deterministic, nondeterministic, and strongly nondeterministic decision trees. Conventional (deterministic) decision trees are widely used as classifiers, as a means of knowledge representation, and as algorithms.",
"type": "quote"
}
],
"glosses": [
"Exhibiting nondeterminism; involving choices between indistinguishable possibilities."
],
"id": "en-nondeterministic-en-adj-Ghc5uL96",
"links": [
[
"computer science",
"computer science"
],
[
"Exhibiting",
"exhibit"
],
[
"nondeterminism",
"nondeterminism"
],
[
"involving",
"involve"
],
[
"choice",
"choice"
],
[
"indistinguishable",
"indistinguishable"
],
[
"possibilities",
"possibility"
]
],
"raw_glosses": [
"(computer science) Exhibiting nondeterminism; involving choices between indistinguishable possibilities."
],
"synonyms": [
{
"word": "non-deterministic"
}
],
"tags": [
"not-comparable"
],
"topics": [
"computer",
"computing",
"engineering",
"mathematics",
"natural-sciences",
"physical-sciences",
"science",
"sciences"
],
"translations": [
{
"code": "cs",
"lang": "Czech",
"sense": "involving choices",
"word": "nedeterministický"
},
{
"code": "nl",
"lang": "Dutch",
"sense": "involving choices",
"word": "niet-deterministisch"
},
{
"code": "fi",
"lang": "Finnish",
"sense": "involving choices",
"word": "epädeterministinen"
},
{
"code": "fr",
"lang": "French",
"sense": "involving choices",
"word": "indéterministe"
},
{
"code": "de",
"lang": "German",
"sense": "involving choices",
"word": "nichtdeterministisch"
},
{
"code": "hu",
"lang": "Hungarian",
"sense": "involving choices",
"word": "nemdeterminisztikus"
},
{
"code": "is",
"lang": "Icelandic",
"sense": "involving choices",
"tags": [
"masculine"
],
"word": "brigðgengur"
},
{
"code": "ro",
"lang": "Romanian",
"sense": "involving choices",
"tags": [
"masculine"
],
"word": "nedeterminist"
}
]
}
],
"word": "nondeterministic"
}
{
"derived": [
{
"word": "complementary nondeterministic polynomial"
},
{
"word": "nondeterministic polynomial time"
},
{
"word": "nondeterministic Turing machine"
},
{
"word": "NP"
}
],
"etymology_templates": [
{
"args": {
"1": "en",
"2": "non",
"3": "deterministic"
},
"expansion": "non- + deterministic",
"name": "prefix"
}
],
"etymology_text": "From non- + deterministic.",
"head_templates": [
{
"args": {
"1": "-"
},
"expansion": "nondeterministic (not comparable)",
"name": "en-adj"
}
],
"lang": "English",
"lang_code": "en",
"pos": "adj",
"senses": [
{
"categories": [
"English adjectives",
"English entries with incorrect language header",
"English lemmas",
"English terms prefixed with non-",
"English terms with quotations",
"English terms with usage examples",
"English uncomparable adjectives",
"Entries with translation boxes",
"Pages with 1 entry",
"Pages with entries",
"Terms with Czech translations",
"Terms with Dutch translations",
"Terms with Finnish translations",
"Terms with French translations",
"Terms with German translations",
"Terms with Hungarian translations",
"Terms with Icelandic translations",
"Terms with Romanian translations",
"en:Computer science"
],
"examples": [
{
"text": "Nondeterministic bottom-up tree automaton recognize the class of regular tree languages.",
"type": "example"
},
{
"ref": "2020, Mikhail Moshkov, Comparative Analysis of Deterministic and Nondeterministic Decision Trees, Springer Nature, →ISBN, page 1:",
"text": "The aim of this book is to compare deterministic, nondeterministic, and strongly nondeterministic decision trees. Conventional (deterministic) decision trees are widely used as classifiers, as a means of knowledge representation, and as algorithms.",
"type": "quote"
}
],
"glosses": [
"Exhibiting nondeterminism; involving choices between indistinguishable possibilities."
],
"links": [
[
"computer science",
"computer science"
],
[
"Exhibiting",
"exhibit"
],
[
"nondeterminism",
"nondeterminism"
],
[
"involving",
"involve"
],
[
"choice",
"choice"
],
[
"indistinguishable",
"indistinguishable"
],
[
"possibilities",
"possibility"
]
],
"raw_glosses": [
"(computer science) Exhibiting nondeterminism; involving choices between indistinguishable possibilities."
],
"tags": [
"not-comparable"
],
"topics": [
"computer",
"computing",
"engineering",
"mathematics",
"natural-sciences",
"physical-sciences",
"science",
"sciences"
]
}
],
"synonyms": [
{
"word": "non-deterministic"
}
],
"translations": [
{
"code": "cs",
"lang": "Czech",
"sense": "involving choices",
"word": "nedeterministický"
},
{
"code": "nl",
"lang": "Dutch",
"sense": "involving choices",
"word": "niet-deterministisch"
},
{
"code": "fi",
"lang": "Finnish",
"sense": "involving choices",
"word": "epädeterministinen"
},
{
"code": "fr",
"lang": "French",
"sense": "involving choices",
"word": "indéterministe"
},
{
"code": "de",
"lang": "German",
"sense": "involving choices",
"word": "nichtdeterministisch"
},
{
"code": "hu",
"lang": "Hungarian",
"sense": "involving choices",
"word": "nemdeterminisztikus"
},
{
"code": "is",
"lang": "Icelandic",
"sense": "involving choices",
"tags": [
"masculine"
],
"word": "brigðgengur"
},
{
"code": "ro",
"lang": "Romanian",
"sense": "involving choices",
"tags": [
"masculine"
],
"word": "nedeterminist"
}
],
"word": "nondeterministic"
}
Download raw JSONL data for nondeterministic meaning in All languages combined (3.2kB)
This page is a part of the kaikki.org machine-readable All languages combined dictionary. This dictionary is based on structured data extracted on 2025-01-18 from the enwiktionary dump dated 2025-01-01 using wiktextract (e4a2c88 and 4230888). 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.