See Day-Stout-Warren algorithm in All languages combined, or Wiktionary
Download JSON data for Day-Stout-Warren algorithm meaning in English (1.7kB)
{
"etymology_text": "Designed by Quentin F. Stout and Bette Warren in a 1986 paper, based on work done by Colin Day in 1976.",
"forms": [
{
"form": "the Day-Stout-Warren algorithm",
"tags": [
"canonical"
]
}
],
"head_templates": [
{
"args": {
"def": "1"
},
"expansion": "the Day-Stout-Warren algorithm",
"name": "en-prop"
}
],
"lang": "English",
"lang_code": "en",
"pos": "name",
"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 entries with language name categories using raw markup",
"parents": [
"Entries with language name categories using raw markup",
"Entry maintenance"
],
"source": "w"
},
{
"kind": "other",
"name": "English terms with non-redundant non-automated sortkeys",
"parents": [
"Terms with non-redundant non-automated sortkeys",
"Entry maintenance"
],
"source": "w"
},
{
"kind": "topical",
"langcode": "en",
"name": "Theory of computing",
"orig": "en:Theory of computing",
"parents": [
"Computer science",
"Computing",
"Sciences",
"Technology",
"All topics",
"Fundamental"
],
"source": "w"
}
],
"glosses": [
"A method for efficiently balancing a binary search tree."
],
"id": "en-Day-Stout-Warren_algorithm-en-name-RA8RGJXX",
"links": [
[
"computing",
"computing#Noun"
],
[
"theory",
"theory"
],
[
"balancing",
"balance"
],
[
"binary search",
"binary search"
],
[
"tree",
"tree"
]
],
"raw_glosses": [
"(computing theory) A method for efficiently balancing a binary search tree."
],
"topics": [
"computing",
"computing-theory",
"engineering",
"mathematics",
"natural-sciences",
"physical-sciences",
"sciences"
]
}
],
"word": "Day-Stout-Warren algorithm"
}
{
"etymology_text": "Designed by Quentin F. Stout and Bette Warren in a 1986 paper, based on work done by Colin Day in 1976.",
"forms": [
{
"form": "the Day-Stout-Warren algorithm",
"tags": [
"canonical"
]
}
],
"head_templates": [
{
"args": {
"def": "1"
},
"expansion": "the Day-Stout-Warren algorithm",
"name": "en-prop"
}
],
"lang": "English",
"lang_code": "en",
"pos": "name",
"senses": [
{
"categories": [
"English entries with incorrect language header",
"English entries with language name categories using raw markup",
"English eponyms",
"English lemmas",
"English multiword terms",
"English proper nouns",
"English terms with non-redundant non-automated sortkeys",
"English uncountable nouns",
"en:Theory of computing"
],
"glosses": [
"A method for efficiently balancing a binary search tree."
],
"links": [
[
"computing",
"computing#Noun"
],
[
"theory",
"theory"
],
[
"balancing",
"balance"
],
[
"binary search",
"binary search"
],
[
"tree",
"tree"
]
],
"raw_glosses": [
"(computing theory) A method for efficiently balancing a binary search tree."
],
"topics": [
"computing",
"computing-theory",
"engineering",
"mathematics",
"natural-sciences",
"physical-sciences",
"sciences"
]
}
],
"word": "Day-Stout-Warren algorithm"
}
This page is a part of the kaikki.org machine-readable English dictionary. This dictionary is based on structured data extracted on 2024-05-05 from the enwiktionary dump dated 2024-05-02 using wiktextract (f4fd8c9 and c9440ce). 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.