See Viterbi algorithm on Wiktionary
{
"etymology_templates": [
{
"args": {
"1": "electrical engineer",
"2": "",
"3": "",
"4": "",
"5": ""
},
"expansion": "electrical engineer",
"name": "named-after/list"
},
{
"args": {},
"expansion": "|",
"name": "!"
},
{
"args": {
"1": "en",
"2": "Andrew Viterbi"
},
"expansion": "Andrew Viterbi",
"name": "lang"
},
{
"args": {
"1": "en",
"2": "Andrew Viterbi",
"born": "1935",
"nat": "Italian–American",
"occ": "electrical engineer",
"wplink": "="
},
"expansion": "Named after Italian–American electrical engineer Andrew Viterbi (1935–)",
"name": "named-after"
}
],
"etymology_text": "Named after Italian–American electrical engineer Andrew Viterbi (1935–), who proposed it in 1967 as a decoding algorithm for convolutional codes over noisy digital communication links.",
"head_templates": [
{
"args": {},
"expansion": "Viterbi algorithm",
"name": "en-proper noun"
}
],
"lang": "English",
"lang_code": "en",
"pos": "name",
"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"
}
],
"glosses": [
"A dynamic programming algorithm for finding the most likely sequence of hidden states (the Viterbi path) that results in a sequence of observed events."
],
"id": "en-Viterbi_algorithm-en-name-gsTujqNX",
"links": [
[
"dynamic programming",
"dynamic programming"
],
[
"algorithm",
"algorithm"
],
[
"sequence",
"sequence"
],
[
"Viterbi path",
"Viterbi path"
]
],
"wikipedia": [
"Viterbi algorithm"
]
}
],
"word": "Viterbi algorithm"
}
{
"etymology_templates": [
{
"args": {
"1": "electrical engineer",
"2": "",
"3": "",
"4": "",
"5": ""
},
"expansion": "electrical engineer",
"name": "named-after/list"
},
{
"args": {},
"expansion": "|",
"name": "!"
},
{
"args": {
"1": "en",
"2": "Andrew Viterbi"
},
"expansion": "Andrew Viterbi",
"name": "lang"
},
{
"args": {
"1": "en",
"2": "Andrew Viterbi",
"born": "1935",
"nat": "Italian–American",
"occ": "electrical engineer",
"wplink": "="
},
"expansion": "Named after Italian–American electrical engineer Andrew Viterbi (1935–)",
"name": "named-after"
}
],
"etymology_text": "Named after Italian–American electrical engineer Andrew Viterbi (1935–), who proposed it in 1967 as a decoding algorithm for convolutional codes over noisy digital communication links.",
"head_templates": [
{
"args": {},
"expansion": "Viterbi algorithm",
"name": "en-proper noun"
}
],
"lang": "English",
"lang_code": "en",
"pos": "name",
"senses": [
{
"categories": [
"English entries with incorrect language header",
"English eponyms",
"English lemmas",
"English multiword terms",
"English proper nouns",
"English uncountable nouns",
"Pages with 1 entry",
"Pages with entries"
],
"glosses": [
"A dynamic programming algorithm for finding the most likely sequence of hidden states (the Viterbi path) that results in a sequence of observed events."
],
"links": [
[
"dynamic programming",
"dynamic programming"
],
[
"algorithm",
"algorithm"
],
[
"sequence",
"sequence"
],
[
"Viterbi path",
"Viterbi path"
]
],
"wikipedia": [
"Viterbi algorithm"
]
}
],
"word": "Viterbi algorithm"
}
Download raw JSONL data for Viterbi algorithm meaning in All languages combined (1.5kB)
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-11-06 from the enwiktionary dump dated 2024-10-02 using wiktextract (fbeafe8 and 7f03c9b). 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.