See recursive function on Wiktionary
{
"forms": [
{
"form": "recursive functions",
"tags": [
"plural"
]
}
],
"head_templates": [
{
"args": {},
"expansion": "recursive function (plural recursive functions)",
"name": "en-noun"
}
],
"lang": "English",
"lang_code": "en",
"pos": "noun",
"senses": [
{
"categories": [
{
"kind": "other",
"langcode": "en",
"name": "Computing",
"orig": "en:Computing",
"parents": [],
"source": "w"
},
{
"_dis": "63 37",
"kind": "other",
"name": "English entries with incorrect language header",
"parents": [],
"source": "w+disamb"
},
{
"_dis": "61 39",
"kind": "other",
"name": "Entries with translation boxes",
"parents": [],
"source": "w+disamb"
},
{
"_dis": "56 44",
"kind": "other",
"name": "Pages with 1 entry",
"parents": [],
"source": "w+disamb"
},
{
"_dis": "61 39",
"kind": "other",
"name": "Pages with entries",
"parents": [],
"source": "w+disamb"
},
{
"_dis": "68 32",
"kind": "other",
"name": "Terms with French translations",
"parents": [],
"source": "w+disamb"
},
{
"_dis": "57 43",
"kind": "other",
"langcode": "en",
"name": "Functions",
"orig": "en:Functions",
"parents": [],
"source": "w+disamb"
}
],
"glosses": [
"Any function that uses recursion and can call itself until a certain condition is met."
],
"hypernyms": [
{
"_dis1": "71 29",
"word": "function"
}
],
"hyponyms": [
{
"_dis1": "71 29",
"word": "partial recursive function"
},
{
"_dis1": "71 29",
"word": "primitive recursive function"
}
],
"id": "en-recursive_function-en-noun-2GnGuemh",
"links": [
[
"computing",
"computing#Noun"
],
[
"recursion",
"recursion"
],
[
"condition",
"condition"
]
],
"raw_glosses": [
"(computing) Any function that uses recursion and can call itself until a certain condition is met."
],
"topics": [
"computing",
"engineering",
"mathematics",
"natural-sciences",
"physical-sciences",
"sciences"
]
},
{
"categories": [
{
"kind": "other",
"langcode": "en",
"name": "Mathematics",
"orig": "en:Mathematics",
"parents": [],
"source": "w"
}
],
"glosses": [
"Any function whose value may be obtained using a finite number of operations using a precisely specified algorithm."
],
"id": "en-recursive_function-en-noun-BIUf3gyN",
"links": [
[
"mathematics",
"mathematics"
],
[
"value",
"value"
],
[
"finite",
"finite"
],
[
"operation",
"operation"
],
[
"algorithm",
"algorithm"
]
],
"raw_glosses": [
"(mathematics) Any function whose value may be obtained using a finite number of operations using a precisely specified algorithm."
],
"topics": [
"mathematics",
"sciences"
]
}
],
"translations": [
{
"_dis1": "51 49",
"code": "fr",
"lang": "French",
"sense": "Translations",
"tags": [
"feminine"
],
"word": "fonction récursive"
}
],
"wikipedia": [
"Computable function",
"Recursion (computer science)"
],
"word": "recursive function"
}
{
"categories": [
"English countable nouns",
"English entries with incorrect language header",
"English lemmas",
"English multiword terms",
"English nouns",
"Entries with translation boxes",
"Pages with 1 entry",
"Pages with entries",
"Terms with French translations",
"Translation table header lacks gloss",
"en:Functions"
],
"forms": [
{
"form": "recursive functions",
"tags": [
"plural"
]
}
],
"head_templates": [
{
"args": {},
"expansion": "recursive function (plural recursive functions)",
"name": "en-noun"
}
],
"hypernyms": [
{
"word": "function"
}
],
"hyponyms": [
{
"word": "partial recursive function"
},
{
"word": "primitive recursive function"
}
],
"lang": "English",
"lang_code": "en",
"pos": "noun",
"senses": [
{
"categories": [
"en:Computing"
],
"glosses": [
"Any function that uses recursion and can call itself until a certain condition is met."
],
"links": [
[
"computing",
"computing#Noun"
],
[
"recursion",
"recursion"
],
[
"condition",
"condition"
]
],
"raw_glosses": [
"(computing) Any function that uses recursion and can call itself until a certain condition is met."
],
"topics": [
"computing",
"engineering",
"mathematics",
"natural-sciences",
"physical-sciences",
"sciences"
]
},
{
"categories": [
"en:Mathematics"
],
"glosses": [
"Any function whose value may be obtained using a finite number of operations using a precisely specified algorithm."
],
"links": [
[
"mathematics",
"mathematics"
],
[
"value",
"value"
],
[
"finite",
"finite"
],
[
"operation",
"operation"
],
[
"algorithm",
"algorithm"
]
],
"raw_glosses": [
"(mathematics) Any function whose value may be obtained using a finite number of operations using a precisely specified algorithm."
],
"topics": [
"mathematics",
"sciences"
]
}
],
"translations": [
{
"code": "fr",
"lang": "French",
"sense": "Translations",
"tags": [
"feminine"
],
"word": "fonction récursive"
}
],
"wikipedia": [
"Computable function",
"Recursion (computer science)"
],
"word": "recursive function"
}
Download raw JSONL data for recursive function meaning in All languages combined (1.9kB)
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-05-21 from the enwiktionary dump dated 2025-05-01 using wiktextract (89ebc88 and e74c913). 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.