See Reingold-Tilford algorithm in All languages combined, or Wiktionary
{
"etymology_text": "Introduced in a 1981 paper by Edward Reingold and John Tilford.",
"forms": [
{
"form": "Reingold-Tilford algorithms",
"tags": [
"plural"
]
}
],
"head_templates": [
{
"args": {},
"expansion": "Reingold-Tilford algorithm (plural Reingold-Tilford algorithms)",
"name": "en-noun"
}
],
"lang": "English",
"lang_code": "en",
"pos": "noun",
"senses": [
{
"categories": [
{
"kind": "other",
"name": "English entries with incorrect language header",
"parents": [
"Entries with incorrect language header",
"Entry maintenance"
],
"source": "w"
},
{
"kind": "other",
"name": "Pages with 1 entry",
"parents": [],
"source": "w"
},
{
"kind": "other",
"name": "Pages with entries",
"parents": [],
"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": [
"An algorithm that generates aesthetically pleasing drawings of binary trees (and by extension, n-ary trees)."
],
"id": "en-Reingold-Tilford_algorithm-en-noun-qXziQVOS",
"links": [
[
"computing",
"computing#Noun"
],
[
"theory",
"theory"
],
[
"aesthetically",
"aesthetically"
],
[
"pleasing",
"pleasing"
],
[
"drawing",
"drawing"
],
[
"binary tree",
"binary tree"
],
[
"n-ary",
"n-ary"
]
],
"raw_glosses": [
"(computing theory) An algorithm that generates aesthetically pleasing drawings of binary trees (and by extension, n-ary trees)."
],
"topics": [
"computing",
"computing-theory",
"engineering",
"mathematics",
"natural-sciences",
"physical-sciences",
"sciences"
]
}
],
"word": "Reingold-Tilford algorithm"
}
{
"etymology_text": "Introduced in a 1981 paper by Edward Reingold and John Tilford.",
"forms": [
{
"form": "Reingold-Tilford algorithms",
"tags": [
"plural"
]
}
],
"head_templates": [
{
"args": {},
"expansion": "Reingold-Tilford algorithm (plural Reingold-Tilford algorithms)",
"name": "en-noun"
}
],
"lang": "English",
"lang_code": "en",
"pos": "noun",
"senses": [
{
"categories": [
"English countable nouns",
"English entries with incorrect language header",
"English eponyms",
"English lemmas",
"English multiword terms",
"English nouns",
"Pages with 1 entry",
"Pages with entries",
"en:Theory of computing"
],
"glosses": [
"An algorithm that generates aesthetically pleasing drawings of binary trees (and by extension, n-ary trees)."
],
"links": [
[
"computing",
"computing#Noun"
],
[
"theory",
"theory"
],
[
"aesthetically",
"aesthetically"
],
[
"pleasing",
"pleasing"
],
[
"drawing",
"drawing"
],
[
"binary tree",
"binary tree"
],
[
"n-ary",
"n-ary"
]
],
"raw_glosses": [
"(computing theory) An algorithm that generates aesthetically pleasing drawings of binary trees (and by extension, n-ary trees)."
],
"topics": [
"computing",
"computing-theory",
"engineering",
"mathematics",
"natural-sciences",
"physical-sciences",
"sciences"
]
}
],
"word": "Reingold-Tilford algorithm"
}
Download raw JSONL data for Reingold-Tilford algorithm meaning in English (1.2kB)
This page is a part of the kaikki.org machine-readable English dictionary. This dictionary is based on structured data extracted on 2025-03-09 from the enwiktionary dump dated 2025-03-02 using wiktextract (32c88e6 and 633533e). 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.