{"id":5987,"date":"2017-02-10T11:17:29","date_gmt":"2017-02-10T11:17:29","guid":{"rendered":"https:\/\/www.techopedia.com\/definition\/viterbi-algorithm\/"},"modified":"2017-02-10T11:17:29","modified_gmt":"2017-02-10T11:17:29","slug":"viterbi-algorithm","status":"publish","type":"definition","link":"https:\/\/www.techopedia.com\/definition\/9950\/viterbi-algorithm","title":{"rendered":"Viterbi Algorithm"},"content":{"rendered":"
The Viterbi algorithm is an algorithm for analyzing a series of hidden states called the Viterbi path. This model is often used in the context of a Markov source, or a source where random variables present significant unknowns.\n<\/p>\n
Essentially, through logical means, the Viterbi algorithm looks at a set of objects according to certain properties, and tries to demonstrate how those properties could affect others. This is often referred to as a Markov chain, and can be demonstrated using a flowchart. Viterbi algorithms are useful in technologies such as speech recognition software, keyword spotting programs and in some types of bioinformatics software systems.<\/p>\n","protected":false},"excerpt":{"rendered":"
What Does Viterbi Algorithm Mean? The Viterbi algorithm is an algorithm for analyzing a series of hidden states called the Viterbi path. This model is often used in the context of a Markov source, or a source where random variables present significant unknowns. Techopedia Explains Viterbi Algorithm Essentially, through logical means, the Viterbi algorithm looks […]<\/p>\n","protected":false},"author":7813,"featured_media":0,"comment_status":"open","ping_status":"closed","template":"","format":"standard","meta":{"_acf_changed":false,"_lmt_disableupdate":"","_lmt_disable":"","om_disable_all_campaigns":false,"footnotes":""},"definitioncat":[241],"class_list":["post-5987","definition","type-definition","status-publish","format-standard","hentry","definitioncat-computer-science"],"acf":[],"yoast_head":"\n