See radix tree in All languages combined, or Wiktionary
Download JSON data for radix tree meaning in English (1.4kB)
{
"forms": [
{
"form": "radix trees",
"tags": [
"plural"
]
}
],
"head_templates": [
{
"args": {},
"expansion": "radix tree (plural radix trees)",
"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": "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 space-optimized trie data structure in which each node that is the only child is merged with its parent."
],
"hyponyms": [
{
"word": "Patricia tree"
}
],
"id": "en-radix_tree-en-noun-FclsVKvk",
"links": [
[
"computing",
"computing#Noun"
],
[
"theory",
"theory"
],
[
"space",
"space"
],
[
"optimize",
"optimize"
],
[
"trie",
"trie"
],
[
"data structure",
"data structure"
],
[
"node",
"node"
],
[
"child",
"child"
],
[
"merge",
"merge"
],
[
"parent",
"parent"
]
],
"raw_glosses": [
"(computing theory) A space-optimized trie data structure in which each node that is the only child is merged with its parent."
],
"topics": [
"computing",
"computing-theory",
"engineering",
"mathematics",
"natural-sciences",
"physical-sciences",
"sciences"
],
"wikipedia": [
"radix tree"
]
}
],
"sounds": [
{
"rhymes": "-iː"
}
],
"word": "radix tree"
}
{
"forms": [
{
"form": "radix trees",
"tags": [
"plural"
]
}
],
"head_templates": [
{
"args": {},
"expansion": "radix tree (plural radix trees)",
"name": "en-noun"
}
],
"hyponyms": [
{
"word": "Patricia tree"
}
],
"lang": "English",
"lang_code": "en",
"pos": "noun",
"senses": [
{
"categories": [
"English countable nouns",
"English entries with incorrect language header",
"English lemmas",
"English multiword terms",
"English nouns",
"Rhymes:English/iː",
"Rhymes:English/iː/3 syllables",
"en:Theory of computing"
],
"glosses": [
"A space-optimized trie data structure in which each node that is the only child is merged with its parent."
],
"links": [
[
"computing",
"computing#Noun"
],
[
"theory",
"theory"
],
[
"space",
"space"
],
[
"optimize",
"optimize"
],
[
"trie",
"trie"
],
[
"data structure",
"data structure"
],
[
"node",
"node"
],
[
"child",
"child"
],
[
"merge",
"merge"
],
[
"parent",
"parent"
]
],
"raw_glosses": [
"(computing theory) A space-optimized trie data structure in which each node that is the only child is merged with its parent."
],
"topics": [
"computing",
"computing-theory",
"engineering",
"mathematics",
"natural-sciences",
"physical-sciences",
"sciences"
],
"wikipedia": [
"radix tree"
]
}
],
"sounds": [
{
"rhymes": "-iː"
}
],
"word": "radix tree"
}
This page is a part of the kaikki.org machine-readable English dictionary. This dictionary is based on structured data extracted on 2024-05-01 from the enwiktionary dump dated 2024-04-21 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.