About: Viterbi algorithm

Facets (new session)
Description
Metadata
Settings
- Rule:
- Inverse Functional Properties:
- "Same As":

About: Viterbi algorithm Goto Sponge NotDistinct Permalink

An Entity of Type : dbo:Software, within Data Space : el.dbpedia.org associated with source document(s)

The Viterbi algorithm is a dynamic programming algorithm for obtaining the maximum a posteriori probability estimate of the most likely sequence of hidden states—called the Viterbi path—that results in a sequence of observed events, especially in the context of Markov information sources and hidden Markov models (HMM).

Attributes	Values
rdf:type	software
rdfs:label	Viterbi algorithm (en)
rdfs:comment	The Viterbi algorithm is a dynamic programming algorithm for obtaining the maximum a posteriori probability estimate of the most likely sequence of hidden states—called the Viterbi path—that results in a sequence of observed events, especially in the context of Markov information sources and hidden Markov models (HMM). (en)
sameAs	Viterbi algorithm Viterbi algorithm
dbp:wikiPageUsesTemplate	dbt:Cite_book dbt:Cite_journal dbt:Clarify dbt:Short_description
Subject	Articles with example Python (programming language) code Dynamic programming Error detection and correction Markov models
gold:hypernym	Algorithm
prov:wasDerivedFrom	http://en.wikipedia.org/wiki/Viterbi_algorithm?oldid=1072142664&ns=0
Wikipage page ID	228015 (xsd:integer)
page length (characters) of wiki page	24842 (xsd:nonNegativeInteger)
Wikipage revision ID	1072142664 (xsd:integer)
has abstract	The Viterbi algorithm is a dynamic programming algorithm for obtaining the maximum a posteriori probability estimate of the most likely sequence of hidden states—called the Viterbi path—that results in a sequence of observed events, especially in the context of Markov information sources and hidden Markov models (HMM). The algorithm has found universal application in decoding the convolutional codes used in both CDMA and GSM digital cellular, dial-up modems, satellite, deep-space communications, and 802.11 wireless LANs. It is now also commonly used in speech recognition, speech synthesis, diarization, keyword spotting, computational linguistics, and bioinformatics. For example, in speech-to-text (speech recognition), the acoustic signal is treated as the observed sequence of events, and a string of text is considered to be the "hidden cause" of the acoustic signal. The Viterbi algorithm finds the most likely string of text given the acoustic signal. (en)
foaf:isPrimaryTopicOf	http://en.wikipedia.org/wiki/Viterbi_algorithm
is rdfs:seeAlso of	Convolutional code
is significant project of	Andrew Viterbi
is Wikipage redirect of	Viterbi Algorithm Soft Output Viterbi Algorithm Soft output Viterbi algorithm Viterbi's algorithm Viterbi coding Viterbi path Viterbi search Vitterbi algorithm
is Link from a Wikipage to another Wikipage of	Forward algorithm Forward–backward algorithm List of terms relating to algorithms and data structures Noise-predictive maximum-likelihood detection Numbers (season 5) ARC (processor) Andrew Viterbi Approximate Bayesian computation ArduSat Baum–Welch algorithm Bayesian programming Belief propagation Bergamo Butterfly diagram Generalized distributive law Jeremiah F. Hayes Joachim Hagenauer Chart parser DVB-T Link grammar List of Italian Americans List of Italian inventions and discoveries List of Jewish American businesspeople List of eponyms (L–Z) List of graph theory topics List of important publications in computer science List of international fellows of the Royal Academy of Engineering Coding theory Computer engineering compendium Conditional random field Constructing skill trees Continuous phase modulation Convolutional code Dynamic programming Dynamic time warping ELVEES Multicore Hidden Markov model List of Massachusetts Institute of Technology alumni List of University of Southern California people List of West European Jews List of algebraic coding theory topics List of algorithms List of computer scientists Millennium Technology Prize Dave Forney Equalization (communications) Error correction code Grassfire transform Expectation–maximization algorithm Intersymbol interference Low-density parity-check code Iterative Viterbi decoding MIT Electrical Engineering and Computer Science Department Markov chain Markov information source Markov model Mathematical diagram Maximum-entropy Markov model Multiple sequence alignment Multiuser detection

Faceted Search & Find service v1.17_git151 as of Feb 20 2025

Alternative Linked Data Documents: ODE Content Formats:

RDF

ODATA

Microdata

About

OpenLink Virtuoso version 07.20.3240 as of Nov 11 2024, on Linux (x86_64-ubuntu_focal-linux-gnu), Single-Server Edition (72 GB total memory, 1 GB memory in use)
Data on this page belongs to its respective rights holders.
Virtuoso Faceted Browser Copyright © 2009-2025 OpenLink Software