See recursive on Wiktionary
Download JSON data for recursive meaning in All languages combined (13.6kB)
{
"antonyms": [
{
"word": "non-recursive"
}
],
"derived": [
{
"_dis1": "0 0 0 0 0",
"word": "co-recursive"
},
{
"_dis1": "0 0 0 0 0",
"word": "crock recursion"
},
{
"_dis1": "0 0 0 0 0",
"word": "filtered-popping recursive transition network"
},
{
"_dis1": "0 0 0 0 0",
"word": "left-recursive"
},
{
"_dis1": "0 0 0 0 0",
"word": "recursion"
},
{
"_dis1": "0 0 0 0 0",
"word": "recursive acronym"
},
{
"_dis1": "0 0 0 0 0",
"word": "recursive conundrum"
},
{
"_dis1": "0 0 0 0 0",
"word": "recursive definition"
},
{
"_dis1": "0 0 0 0 0",
"word": "recursive descent"
},
{
"_dis1": "0 0 0 0 0",
"word": "recursive function"
},
{
"_dis1": "0 0 0 0 0",
"word": "recursively"
},
{
"_dis1": "0 0 0 0 0",
"word": "recursiveness"
},
{
"_dis1": "0 0 0 0 0",
"word": "recursive neural network"
}
],
"etymology_templates": [
{
"args": {
"1": "en",
"2": "ine-pro",
"3": "*ḱers-"
},
"expansion": "",
"name": "root"
},
{
"args": {
"1": "en",
"2": "NL.",
"3": "recursīvus"
},
"expansion": "Learned borrowing from New Latin recursīvus",
"name": "lbor"
},
{
"args": {
"1": "en",
"2": "recurs",
"3": "-ive"
},
"expansion": "recurs + -ive",
"name": "affix"
}
],
"etymology_text": "Learned borrowing from New Latin recursīvus. Equivalent to recurs + -ive",
"forms": [
{
"form": "more recursive",
"tags": [
"comparative"
]
},
{
"form": "most recursive",
"tags": [
"superlative"
]
}
],
"head_templates": [
{
"args": {},
"expansion": "recursive (comparative more recursive, superlative most recursive)",
"name": "en-adj"
}
],
"lang": "English",
"lang_code": "en",
"pos": "adj",
"senses": [
{
"categories": [],
"examples": [
{
"text": "The recursive nature of stories which borrow from each other",
"type": "example"
}
],
"glosses": [
"drawing upon itself, referring back."
],
"id": "en-recursive-en-adj-P41nImLJ",
"links": [
[
"draw",
"draw"
]
],
"translations": [
{
"_dis1": "74 3 19 2 3",
"code": "nl",
"lang": "Dutch",
"sense": "drawing upon itself",
"word": "recursief"
},
{
"_dis1": "74 3 19 2 3",
"code": "fi",
"lang": "Finnish",
"sense": "drawing upon itself",
"word": "itseään toistava"
},
{
"_dis1": "74 3 19 2 3",
"code": "fr",
"lang": "French",
"sense": "drawing upon itself",
"word": "récursif"
},
{
"_dis1": "74 3 19 2 3",
"code": "de",
"lang": "German",
"sense": "drawing upon itself",
"word": "rekursiv"
},
{
"_dis1": "74 3 19 2 3",
"code": "el",
"lang": "Greek",
"roman": "epanalamvanómenos",
"sense": "drawing upon itself",
"tags": [
"masculine"
],
"word": "επαναλαμβανόμενος"
},
{
"_dis1": "74 3 19 2 3",
"code": "el",
"lang": "Greek",
"roman": "epanerchómenos",
"sense": "drawing upon itself",
"tags": [
"masculine"
],
"word": "επανερχόμενος"
},
{
"_dis1": "74 3 19 2 3",
"code": "el",
"lang": "Greek",
"roman": "anadromikós",
"sense": "drawing upon itself",
"tags": [
"masculine"
],
"word": "αναδρομικός"
},
{
"_dis1": "74 3 19 2 3",
"code": "pt",
"lang": "Portuguese",
"sense": "drawing upon itself",
"word": "recursivo"
},
{
"_dis1": "74 3 19 2 3",
"code": "sh",
"lang": "Serbo-Croatian",
"sense": "drawing upon itself",
"word": "рекурзиван"
},
{
"_dis1": "74 3 19 2 3",
"code": "es",
"lang": "Spanish",
"sense": "drawing upon itself",
"word": "recursivo"
},
{
"_dis1": "74 3 19 2 3",
"code": "uk",
"lang": "Ukrainian",
"roman": "rekursývnyj",
"sense": "drawing upon itself",
"word": "рекурси́вний"
}
]
},
{
"categories": [
{
"kind": "topical",
"langcode": "en",
"name": "Mathematics",
"orig": "en:Mathematics",
"parents": [
"Formal sciences",
"Sciences",
"All topics",
"Fundamental"
],
"source": "w"
},
{
"_dis": "5 18 22 26 29",
"kind": "other",
"name": "English entries with incorrect language header",
"parents": [
"Entries with incorrect language header",
"Entry maintenance"
],
"source": "w+disamb"
},
{
"_dis": "7 36 17 17 23",
"kind": "other",
"name": "English terms suffixed with -ive",
"parents": [],
"source": "w+disamb"
}
],
"glosses": [
"of an expression, each term of which is determined by applying a formula to preceding terms"
],
"id": "en-recursive-en-adj-2qdR3vd~",
"links": [
[
"mathematics",
"mathematics"
],
[
"expression",
"expression"
],
[
"term",
"term"
],
[
"determined",
"determined"
],
[
"formula",
"formula"
],
[
"preceding",
"preceding"
]
],
"raw_glosses": [
"(mathematics, not comparable) of an expression, each term of which is determined by applying a formula to preceding terms"
],
"tags": [
"not-comparable"
],
"topics": [
"mathematics",
"sciences"
],
"translations": [
{
"_dis1": "3 74 6 9 7",
"code": "cs",
"lang": "Czech",
"sense": "mathematics: of an expression, in which each term is determined by applying a formula to preceding terms",
"word": "rekurzivní"
},
{
"_dis1": "3 74 6 9 7",
"code": "nl",
"lang": "Dutch",
"sense": "mathematics: of an expression, in which each term is determined by applying a formula to preceding terms",
"word": "recursief"
},
{
"_dis1": "3 74 6 9 7",
"code": "fi",
"lang": "Finnish",
"sense": "mathematics: of an expression, in which each term is determined by applying a formula to preceding terms",
"word": "rekursiivinen"
},
{
"_dis1": "3 74 6 9 7",
"code": "fr",
"lang": "French",
"sense": "mathematics: of an expression, in which each term is determined by applying a formula to preceding terms",
"word": "récursif"
},
{
"_dis1": "3 74 6 9 7",
"code": "de",
"lang": "German",
"sense": "mathematics: of an expression, in which each term is determined by applying a formula to preceding terms",
"word": "rekursiv"
},
{
"_dis1": "3 74 6 9 7",
"code": "el",
"lang": "Greek",
"roman": "anadromikós",
"sense": "mathematics: of an expression, in which each term is determined by applying a formula to preceding terms",
"tags": [
"masculine"
],
"word": "αναδρομικός"
},
{
"_dis1": "3 74 6 9 7",
"code": "pl",
"lang": "Polish",
"sense": "mathematics: of an expression, in which each term is determined by applying a formula to preceding terms",
"tags": [
"masculine"
],
"word": "rekurencyjny"
},
{
"_dis1": "3 74 6 9 7",
"code": "pt",
"lang": "Portuguese",
"sense": "mathematics: of an expression, in which each term is determined by applying a formula to preceding terms",
"word": "recursivo"
},
{
"_dis1": "3 74 6 9 7",
"code": "es",
"lang": "Spanish",
"sense": "mathematics: of an expression, in which each term is determined by applying a formula to preceding terms",
"tags": [
"masculine"
],
"word": "iteractivo"
},
{
"_dis1": "3 74 6 9 7",
"code": "es",
"lang": "Spanish",
"sense": "mathematics: of an expression, in which each term is determined by applying a formula to preceding terms",
"tags": [
"feminine",
"masculine"
],
"word": "recurrente"
}
]
},
{
"categories": [
{
"kind": "topical",
"langcode": "en",
"name": "Computing",
"orig": "en:Computing",
"parents": [
"Technology",
"All topics",
"Fundamental"
],
"source": "w"
},
{
"_dis": "5 18 22 26 29",
"kind": "other",
"name": "English entries with incorrect language header",
"parents": [
"Entries with incorrect language header",
"Entry maintenance"
],
"source": "w+disamb"
}
],
"glosses": [
"of a program or function that calls itself"
],
"hyponyms": [
{
"_dis1": "0 0 56 0 44",
"sense": "of a function",
"word": "primitive recursive"
},
{
"_dis1": "0 0 56 0 44",
"sense": "of a function",
"word": "tail recursive"
}
],
"id": "en-recursive-en-adj-zaDbPO2Q",
"links": [
[
"computing",
"computing#Noun"
],
[
"program",
"program"
],
[
"function",
"function"
],
[
"call",
"call#1.4 Verb"
]
],
"raw_glosses": [
"(computing, not comparable) of a program or function that calls itself"
],
"tags": [
"not-comparable"
],
"topics": [
"computing",
"engineering",
"mathematics",
"natural-sciences",
"physical-sciences",
"sciences"
],
"translations": [
{
"_dis1": "19 2 57 10 12",
"code": "cs",
"lang": "Czech",
"sense": "computing: of a program or function that calls itself",
"word": "rekurzivní"
},
{
"_dis1": "19 2 57 10 12",
"code": "nl",
"lang": "Dutch",
"sense": "computing: of a program or function that calls itself",
"word": "recursief"
},
{
"_dis1": "19 2 57 10 12",
"code": "fi",
"lang": "Finnish",
"sense": "computing: of a program or function that calls itself",
"word": "rekursiivinen"
},
{
"_dis1": "19 2 57 10 12",
"code": "fr",
"lang": "French",
"sense": "computing: of a program or function that calls itself",
"word": "récursif"
},
{
"_dis1": "19 2 57 10 12",
"code": "de",
"lang": "German",
"sense": "computing: of a program or function that calls itself",
"word": "rekursiv"
},
{
"_dis1": "19 2 57 10 12",
"code": "el",
"lang": "Greek",
"roman": "anadromikós",
"sense": "computing: of a program or function that calls itself",
"tags": [
"masculine"
],
"word": "αναδρομικός"
},
{
"_dis1": "19 2 57 10 12",
"code": "hu",
"lang": "Hungarian",
"sense": "computing: of a program or function that calls itself",
"word": "rekurzív"
},
{
"_dis1": "19 2 57 10 12",
"code": "pl",
"lang": "Polish",
"sense": "computing: of a program or function that calls itself",
"tags": [
"masculine"
],
"word": "rekurencyjny"
},
{
"_dis1": "19 2 57 10 12",
"code": "pt",
"lang": "Portuguese",
"sense": "computing: of a program or function that calls itself",
"word": "recursivo"
},
{
"_dis1": "19 2 57 10 12",
"code": "ro",
"lang": "Romanian",
"sense": "computing: of a program or function that calls itself",
"word": "recursiv"
},
{
"_dis1": "19 2 57 10 12",
"code": "es",
"lang": "Spanish",
"sense": "computing: of a program or function that calls itself",
"word": "recursivo"
}
]
},
{
"categories": [
{
"kind": "topical",
"langcode": "en",
"name": "Theory of computing",
"orig": "en:Theory of computing",
"parents": [
"Computer science",
"Computing",
"Sciences",
"Technology",
"All topics",
"Fundamental"
],
"source": "w"
},
{
"_dis": "5 18 22 26 29",
"kind": "other",
"name": "English entries with incorrect language header",
"parents": [
"Entries with incorrect language header",
"Entry maintenance"
],
"source": "w+disamb"
}
],
"glosses": [
"which can be computed by a theoretical model of a computer, in a finite amount of time"
],
"id": "en-recursive-en-adj-myEGs~QZ",
"links": [
[
"computing",
"computing#Noun"
],
[
"theory",
"theory"
]
],
"raw_glosses": [
"(computing theory, not comparable, of a function) which can be computed by a theoretical model of a computer, in a finite amount of time"
],
"raw_tags": [
"of a function"
],
"tags": [
"not-comparable"
],
"topics": [
"computing",
"computing-theory",
"engineering",
"mathematics",
"natural-sciences",
"physical-sciences",
"sciences"
],
"translations": [
{
"_dis1": "3 3 14 67 13",
"code": "nl",
"lang": "Dutch",
"sense": "computing: of a function which can be computed in a finite amount of time",
"word": "recursief"
},
{
"_dis1": "3 3 14 67 13",
"code": "fi",
"lang": "Finnish",
"sense": "computing: of a function which can be computed in a finite amount of time",
"word": "rekursiivinen"
},
{
"_dis1": "3 3 14 67 13",
"code": "de",
"lang": "German",
"sense": "computing: of a function which can be computed in a finite amount of time",
"word": "rekursiv"
},
{
"_dis1": "3 3 14 67 13",
"code": "el",
"lang": "Greek",
"roman": "anadromikós",
"sense": "computing: of a function which can be computed in a finite amount of time",
"tags": [
"masculine"
],
"word": "αναδρομικός"
},
{
"_dis1": "3 3 14 67 13",
"code": "fa",
"lang": "Persian",
"sense": "computing: of a function which can be computed in a finite amount of time",
"word": "بازگشتی"
},
{
"_dis1": "3 3 14 67 13",
"code": "pt",
"lang": "Portuguese",
"sense": "computing: of a function which can be computed in a finite amount of time",
"word": "recursivo"
}
]
},
{
"categories": [
{
"kind": "topical",
"langcode": "en",
"name": "Theory of computing",
"orig": "en:Theory of computing",
"parents": [
"Computer science",
"Computing",
"Sciences",
"Technology",
"All topics",
"Fundamental"
],
"source": "w"
},
{
"_dis": "5 18 22 26 29",
"kind": "other",
"name": "English entries with incorrect language header",
"parents": [
"Entries with incorrect language header",
"Entry maintenance"
],
"source": "w+disamb"
}
],
"glosses": [
"whose characteristic function is recursive (4)"
],
"hypernyms": [
{
"_dis1": "1 5 6 3 84",
"sense": "of a set, whose characteristic function is recursive",
"word": "recursively enumerable"
}
],
"id": "en-recursive-en-adj-fgtKnB0~",
"links": [
[
"computing",
"computing#Noun"
],
[
"theory",
"theory"
],
[
"recursive",
"recursive"
]
],
"raw_glosses": [
"(computing theory, not comparable, of a set) whose characteristic function is recursive (4)"
],
"raw_tags": [
"of a set"
],
"tags": [
"not-comparable"
],
"topics": [
"computing",
"computing-theory",
"engineering",
"mathematics",
"natural-sciences",
"physical-sciences",
"sciences"
],
"translations": [
{
"_dis1": "3 5 12 11 70",
"code": "nl",
"lang": "Dutch",
"sense": "computing: of a set whose characteristic function is recursive",
"word": "recursief"
},
{
"_dis1": "3 5 12 11 70",
"code": "fi",
"lang": "Finnish",
"sense": "computing: of a set whose characteristic function is recursive",
"word": "rekursiivinen"
},
{
"_dis1": "3 5 12 11 70",
"code": "fr",
"lang": "French",
"sense": "computing: of a set whose characteristic function is recursive",
"word": "récursif"
},
{
"_dis1": "3 5 12 11 70",
"code": "de",
"lang": "German",
"sense": "computing: of a set whose characteristic function is recursive",
"word": "rekursiv"
},
{
"_dis1": "3 5 12 11 70",
"code": "el",
"lang": "Greek",
"roman": "anadromikós",
"sense": "computing: of a set whose characteristic function is recursive",
"tags": [
"masculine"
],
"word": "αναδρομικός"
},
{
"_dis1": "3 5 12 11 70",
"code": "sh",
"lang": "Serbo-Croatian",
"sense": "computing: of a set whose characteristic function is recursive",
"word": "rekurzivan"
}
]
}
],
"sounds": [
{
"ipa": "/ɹɪˈkɜː(ɹ)sɪv/"
},
{
"rhymes": "-ɜː(ɹ)sɪv"
},
{
"audio": "LL-Q1860 (eng)-Vealhurl-recursive.wav",
"mp3_url": "https://upload.wikimedia.org/wikipedia/commons/transcoded/6/68/LL-Q1860_%28eng%29-Vealhurl-recursive.wav/LL-Q1860_%28eng%29-Vealhurl-recursive.wav.mp3",
"ogg_url": "https://upload.wikimedia.org/wikipedia/commons/transcoded/6/68/LL-Q1860_%28eng%29-Vealhurl-recursive.wav/LL-Q1860_%28eng%29-Vealhurl-recursive.wav.ogg",
"tags": [
"Southern-England"
],
"text": "Audio (Southern England)"
}
],
"word": "recursive"
}
{
"antonyms": [
{
"word": "non-recursive"
}
],
"categories": [
"English 3-syllable words",
"English adjectives",
"English entries with incorrect language header",
"English learned borrowings from New Latin",
"English lemmas",
"English terms borrowed from New Latin",
"English terms derived from New Latin",
"English terms derived from Proto-Indo-European",
"English terms derived from the Proto-Indo-European root *ḱers-",
"English terms suffixed with -ive",
"English terms with IPA pronunciation",
"English terms with audio links",
"Requests for review of French translations",
"Requests for review of Serbo-Croatian translations",
"Rhymes:English/ɜː(ɹ)sɪv"
],
"derived": [
{
"word": "co-recursive"
},
{
"word": "crock recursion"
},
{
"word": "filtered-popping recursive transition network"
},
{
"word": "left-recursive"
},
{
"word": "recursion"
},
{
"word": "recursive acronym"
},
{
"word": "recursive conundrum"
},
{
"word": "recursive definition"
},
{
"word": "recursive descent"
},
{
"word": "recursive function"
},
{
"word": "recursively"
},
{
"word": "recursiveness"
},
{
"word": "recursive neural network"
}
],
"etymology_templates": [
{
"args": {
"1": "en",
"2": "ine-pro",
"3": "*ḱers-"
},
"expansion": "",
"name": "root"
},
{
"args": {
"1": "en",
"2": "NL.",
"3": "recursīvus"
},
"expansion": "Learned borrowing from New Latin recursīvus",
"name": "lbor"
},
{
"args": {
"1": "en",
"2": "recurs",
"3": "-ive"
},
"expansion": "recurs + -ive",
"name": "affix"
}
],
"etymology_text": "Learned borrowing from New Latin recursīvus. Equivalent to recurs + -ive",
"forms": [
{
"form": "more recursive",
"tags": [
"comparative"
]
},
{
"form": "most recursive",
"tags": [
"superlative"
]
}
],
"head_templates": [
{
"args": {},
"expansion": "recursive (comparative more recursive, superlative most recursive)",
"name": "en-adj"
}
],
"hypernyms": [
{
"sense": "of a set, whose characteristic function is recursive",
"word": "recursively enumerable"
}
],
"hyponyms": [
{
"sense": "of a function",
"word": "primitive recursive"
},
{
"sense": "of a function",
"word": "tail recursive"
}
],
"lang": "English",
"lang_code": "en",
"pos": "adj",
"senses": [
{
"categories": [
"English terms with usage examples"
],
"examples": [
{
"text": "The recursive nature of stories which borrow from each other",
"type": "example"
}
],
"glosses": [
"drawing upon itself, referring back."
],
"links": [
[
"draw",
"draw"
]
]
},
{
"categories": [
"en:Mathematics"
],
"glosses": [
"of an expression, each term of which is determined by applying a formula to preceding terms"
],
"links": [
[
"mathematics",
"mathematics"
],
[
"expression",
"expression"
],
[
"term",
"term"
],
[
"determined",
"determined"
],
[
"formula",
"formula"
],
[
"preceding",
"preceding"
]
],
"raw_glosses": [
"(mathematics, not comparable) of an expression, each term of which is determined by applying a formula to preceding terms"
],
"tags": [
"not-comparable"
],
"topics": [
"mathematics",
"sciences"
]
},
{
"categories": [
"en:Computing"
],
"glosses": [
"of a program or function that calls itself"
],
"links": [
[
"computing",
"computing#Noun"
],
[
"program",
"program"
],
[
"function",
"function"
],
[
"call",
"call#1.4 Verb"
]
],
"raw_glosses": [
"(computing, not comparable) of a program or function that calls itself"
],
"tags": [
"not-comparable"
],
"topics": [
"computing",
"engineering",
"mathematics",
"natural-sciences",
"physical-sciences",
"sciences"
]
},
{
"categories": [
"en:Theory of computing"
],
"glosses": [
"which can be computed by a theoretical model of a computer, in a finite amount of time"
],
"links": [
[
"computing",
"computing#Noun"
],
[
"theory",
"theory"
]
],
"raw_glosses": [
"(computing theory, not comparable, of a function) which can be computed by a theoretical model of a computer, in a finite amount of time"
],
"raw_tags": [
"of a function"
],
"tags": [
"not-comparable"
],
"topics": [
"computing",
"computing-theory",
"engineering",
"mathematics",
"natural-sciences",
"physical-sciences",
"sciences"
]
},
{
"categories": [
"en:Theory of computing"
],
"glosses": [
"whose characteristic function is recursive (4)"
],
"links": [
[
"computing",
"computing#Noun"
],
[
"theory",
"theory"
],
[
"recursive",
"recursive"
]
],
"raw_glosses": [
"(computing theory, not comparable, of a set) whose characteristic function is recursive (4)"
],
"raw_tags": [
"of a set"
],
"tags": [
"not-comparable"
],
"topics": [
"computing",
"computing-theory",
"engineering",
"mathematics",
"natural-sciences",
"physical-sciences",
"sciences"
]
}
],
"sounds": [
{
"ipa": "/ɹɪˈkɜː(ɹ)sɪv/"
},
{
"rhymes": "-ɜː(ɹ)sɪv"
},
{
"audio": "LL-Q1860 (eng)-Vealhurl-recursive.wav",
"mp3_url": "https://upload.wikimedia.org/wikipedia/commons/transcoded/6/68/LL-Q1860_%28eng%29-Vealhurl-recursive.wav/LL-Q1860_%28eng%29-Vealhurl-recursive.wav.mp3",
"ogg_url": "https://upload.wikimedia.org/wikipedia/commons/transcoded/6/68/LL-Q1860_%28eng%29-Vealhurl-recursive.wav/LL-Q1860_%28eng%29-Vealhurl-recursive.wav.ogg",
"tags": [
"Southern-England"
],
"text": "Audio (Southern England)"
}
],
"translations": [
{
"code": "nl",
"lang": "Dutch",
"sense": "drawing upon itself",
"word": "recursief"
},
{
"code": "fi",
"lang": "Finnish",
"sense": "drawing upon itself",
"word": "itseään toistava"
},
{
"code": "fr",
"lang": "French",
"sense": "drawing upon itself",
"word": "récursif"
},
{
"code": "de",
"lang": "German",
"sense": "drawing upon itself",
"word": "rekursiv"
},
{
"code": "el",
"lang": "Greek",
"roman": "epanalamvanómenos",
"sense": "drawing upon itself",
"tags": [
"masculine"
],
"word": "επαναλαμβανόμενος"
},
{
"code": "el",
"lang": "Greek",
"roman": "epanerchómenos",
"sense": "drawing upon itself",
"tags": [
"masculine"
],
"word": "επανερχόμενος"
},
{
"code": "el",
"lang": "Greek",
"roman": "anadromikós",
"sense": "drawing upon itself",
"tags": [
"masculine"
],
"word": "αναδρομικός"
},
{
"code": "pt",
"lang": "Portuguese",
"sense": "drawing upon itself",
"word": "recursivo"
},
{
"code": "sh",
"lang": "Serbo-Croatian",
"sense": "drawing upon itself",
"word": "рекурзиван"
},
{
"code": "es",
"lang": "Spanish",
"sense": "drawing upon itself",
"word": "recursivo"
},
{
"code": "uk",
"lang": "Ukrainian",
"roman": "rekursývnyj",
"sense": "drawing upon itself",
"word": "рекурси́вний"
},
{
"code": "cs",
"lang": "Czech",
"sense": "mathematics: of an expression, in which each term is determined by applying a formula to preceding terms",
"word": "rekurzivní"
},
{
"code": "nl",
"lang": "Dutch",
"sense": "mathematics: of an expression, in which each term is determined by applying a formula to preceding terms",
"word": "recursief"
},
{
"code": "fi",
"lang": "Finnish",
"sense": "mathematics: of an expression, in which each term is determined by applying a formula to preceding terms",
"word": "rekursiivinen"
},
{
"code": "fr",
"lang": "French",
"sense": "mathematics: of an expression, in which each term is determined by applying a formula to preceding terms",
"word": "récursif"
},
{
"code": "de",
"lang": "German",
"sense": "mathematics: of an expression, in which each term is determined by applying a formula to preceding terms",
"word": "rekursiv"
},
{
"code": "el",
"lang": "Greek",
"roman": "anadromikós",
"sense": "mathematics: of an expression, in which each term is determined by applying a formula to preceding terms",
"tags": [
"masculine"
],
"word": "αναδρομικός"
},
{
"code": "pl",
"lang": "Polish",
"sense": "mathematics: of an expression, in which each term is determined by applying a formula to preceding terms",
"tags": [
"masculine"
],
"word": "rekurencyjny"
},
{
"code": "pt",
"lang": "Portuguese",
"sense": "mathematics: of an expression, in which each term is determined by applying a formula to preceding terms",
"word": "recursivo"
},
{
"code": "es",
"lang": "Spanish",
"sense": "mathematics: of an expression, in which each term is determined by applying a formula to preceding terms",
"tags": [
"masculine"
],
"word": "iteractivo"
},
{
"code": "es",
"lang": "Spanish",
"sense": "mathematics: of an expression, in which each term is determined by applying a formula to preceding terms",
"tags": [
"feminine",
"masculine"
],
"word": "recurrente"
},
{
"code": "cs",
"lang": "Czech",
"sense": "computing: of a program or function that calls itself",
"word": "rekurzivní"
},
{
"code": "nl",
"lang": "Dutch",
"sense": "computing: of a program or function that calls itself",
"word": "recursief"
},
{
"code": "fi",
"lang": "Finnish",
"sense": "computing: of a program or function that calls itself",
"word": "rekursiivinen"
},
{
"code": "fr",
"lang": "French",
"sense": "computing: of a program or function that calls itself",
"word": "récursif"
},
{
"code": "de",
"lang": "German",
"sense": "computing: of a program or function that calls itself",
"word": "rekursiv"
},
{
"code": "el",
"lang": "Greek",
"roman": "anadromikós",
"sense": "computing: of a program or function that calls itself",
"tags": [
"masculine"
],
"word": "αναδρομικός"
},
{
"code": "hu",
"lang": "Hungarian",
"sense": "computing: of a program or function that calls itself",
"word": "rekurzív"
},
{
"code": "pl",
"lang": "Polish",
"sense": "computing: of a program or function that calls itself",
"tags": [
"masculine"
],
"word": "rekurencyjny"
},
{
"code": "pt",
"lang": "Portuguese",
"sense": "computing: of a program or function that calls itself",
"word": "recursivo"
},
{
"code": "ro",
"lang": "Romanian",
"sense": "computing: of a program or function that calls itself",
"word": "recursiv"
},
{
"code": "es",
"lang": "Spanish",
"sense": "computing: of a program or function that calls itself",
"word": "recursivo"
},
{
"code": "nl",
"lang": "Dutch",
"sense": "computing: of a function which can be computed in a finite amount of time",
"word": "recursief"
},
{
"code": "fi",
"lang": "Finnish",
"sense": "computing: of a function which can be computed in a finite amount of time",
"word": "rekursiivinen"
},
{
"code": "de",
"lang": "German",
"sense": "computing: of a function which can be computed in a finite amount of time",
"word": "rekursiv"
},
{
"code": "el",
"lang": "Greek",
"roman": "anadromikós",
"sense": "computing: of a function which can be computed in a finite amount of time",
"tags": [
"masculine"
],
"word": "αναδρομικός"
},
{
"code": "fa",
"lang": "Persian",
"sense": "computing: of a function which can be computed in a finite amount of time",
"word": "بازگشتی"
},
{
"code": "pt",
"lang": "Portuguese",
"sense": "computing: of a function which can be computed in a finite amount of time",
"word": "recursivo"
},
{
"code": "nl",
"lang": "Dutch",
"sense": "computing: of a set whose characteristic function is recursive",
"word": "recursief"
},
{
"code": "fi",
"lang": "Finnish",
"sense": "computing: of a set whose characteristic function is recursive",
"word": "rekursiivinen"
},
{
"code": "fr",
"lang": "French",
"sense": "computing: of a set whose characteristic function is recursive",
"word": "récursif"
},
{
"code": "de",
"lang": "German",
"sense": "computing: of a set whose characteristic function is recursive",
"word": "rekursiv"
},
{
"code": "el",
"lang": "Greek",
"roman": "anadromikós",
"sense": "computing: of a set whose characteristic function is recursive",
"tags": [
"masculine"
],
"word": "αναδρομικός"
},
{
"code": "sh",
"lang": "Serbo-Croatian",
"sense": "computing: of a set whose characteristic function is recursive",
"word": "rekurzivan"
}
],
"word": "recursive"
}
This page is a part of the kaikki.org machine-readable All languages combined dictionary. This dictionary is based on structured data extracted on 2024-05-03 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.