See iterative deepening search in All languages combined, or Wiktionary
{
"forms": [
{
"form": "iterative deepening searches",
"tags": [
"plural"
]
}
],
"head_templates": [
{
"args": {
"1": "~"
},
"expansion": "iterative deepening search (countable and uncountable, plural iterative deepening searches)",
"name": "en-noun"
}
],
"lang": "English",
"lang_code": "en",
"pos": "noun",
"senses": [
{
"categories": [
{
"kind": "other",
"name": "English entries with incorrect language header",
"parents": [],
"source": "w"
},
{
"kind": "other",
"name": "Pages with 1 entry",
"parents": [],
"source": "w"
},
{
"kind": "other",
"name": "Pages with entries",
"parents": [],
"source": "w"
},
{
"kind": "other",
"langcode": "en",
"name": "Computer science",
"orig": "en:Computer science",
"parents": [],
"source": "w"
},
{
"kind": "other",
"langcode": "en",
"name": "Graph theory",
"orig": "en:Graph theory",
"parents": [],
"source": "w"
}
],
"glosses": [
"A type of depth-first search in which each row of the tree is searched incrementally, simulating a breadth-first search with less memory usage."
],
"id": "en-iterative_deepening_search-en-noun-ElT5-yvn",
"links": [
[
"computer science",
"computer science"
],
[
"graph theory",
"graph theory"
],
[
"depth-first search",
"depth-first search"
],
[
"breadth-first search",
"breadth-first search"
],
[
"memory",
"memory"
]
],
"raw_glosses": [
"(computer science, graph theory) A type of depth-first search in which each row of the tree is searched incrementally, simulating a breadth-first search with less memory usage."
],
"synonyms": [
{
"word": "iterative deepening depth-first search"
},
{
"tags": [
"initialism"
],
"word": "IDS"
},
{
"tags": [
"initialism"
],
"word": "IDDFS"
}
],
"tags": [
"countable",
"uncountable"
],
"topics": [
"computer",
"computing",
"engineering",
"graph-theory",
"mathematics",
"natural-sciences",
"physical-sciences",
"science",
"sciences"
]
}
],
"word": "iterative deepening search"
}
{
"forms": [
{
"form": "iterative deepening searches",
"tags": [
"plural"
]
}
],
"head_templates": [
{
"args": {
"1": "~"
},
"expansion": "iterative deepening search (countable and uncountable, plural iterative deepening searches)",
"name": "en-noun"
}
],
"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",
"English uncountable nouns",
"Pages with 1 entry",
"Pages with entries",
"en:Computer science",
"en:Graph theory"
],
"glosses": [
"A type of depth-first search in which each row of the tree is searched incrementally, simulating a breadth-first search with less memory usage."
],
"links": [
[
"computer science",
"computer science"
],
[
"graph theory",
"graph theory"
],
[
"depth-first search",
"depth-first search"
],
[
"breadth-first search",
"breadth-first search"
],
[
"memory",
"memory"
]
],
"raw_glosses": [
"(computer science, graph theory) A type of depth-first search in which each row of the tree is searched incrementally, simulating a breadth-first search with less memory usage."
],
"synonyms": [
{
"word": "iterative deepening depth-first search"
},
{
"tags": [
"initialism"
],
"word": "IDS"
},
{
"tags": [
"initialism"
],
"word": "IDDFS"
}
],
"tags": [
"countable",
"uncountable"
],
"topics": [
"computer",
"computing",
"engineering",
"graph-theory",
"mathematics",
"natural-sciences",
"physical-sciences",
"science",
"sciences"
]
}
],
"word": "iterative deepening search"
}
Download raw JSONL data for iterative deepening search meaning in English (1.5kB)
This page is a part of the kaikki.org machine-readable English dictionary. This dictionary is based on structured data extracted on 2025-05-27 from the enwiktionary dump dated 2025-05-20 using wiktextract (a4e883e and f1c2b61). 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.