Viterbi algorithm (English Wikipedia)

Analysis of information sources in references of the Wikipedia article "Viterbi algorithm" in English language version.

Last modified: 23:20:06, 17 July 2026 (UTC)

Ref.Un. Ref.Website

Global rank English rank

2^nd place

2^nd place

5^th place

5^th place

621^st place

429^th place

11web.archive.org

1^st place

1^st place

49^th place

31^st place

low place

low place

194^th place

182^nd place

476^th place

340^th place

low place

low place

aclweb.org (Global: low place; English: low place)

Schmid, Helmut (2004). Efficient parsing of highly ambiguous context-free grammars with bit vectors (PDF). Proc. 20th Int'l Conf. on Computational Linguistics (COLING). doi:10.3115/1220355.1220379.

arxiv.org (Global: 49^th place; English: 31^st place)

29 Apr 2005, G. David Forney Jr: The Viterbi Algorithm: A Personal History

berkeley.edu (Global: 621^st place; English: 429^th place)

www1.icsi.berkeley.edu

Xavier Anguera et al., "Speaker Diarization: A Review of Recent Research" Archived 2016-05-12 at the Wayback Machine, retrieved 19. August 2010, IEEE TASLP

doi.org (Global: 2^nd place; English: 2^nd place)

Schmid, Helmut (2004). Efficient parsing of highly ambiguous context-free grammars with bit vectors (PDF). Proc. 20th Int'l Conf. on Computational Linguistics (COLING). doi:10.3115/1220355.1220379.
Klein, Dan; Manning, Christopher D. (2003). A* parsing: fast exact Viterbi parse selection (PDF). Proc. 2003 Conf. of the North American Chapter of the Association for Computational Linguistics on Human Language Technology (NAACL). pp. 40–47. doi:10.3115/1073445.1073461.
Stanke, M.; Keller, O.; Gunduz, I.; Hayes, A.; Waack, S.; Morgenstern, B. (2006). "AUGUSTUS: Ab initio prediction of alternative transcripts". Nucleic Acids Research. 34 (Web Server issue): W435–W439. doi:10.1093/nar/gkl200. PMC 1538822. PMID 16845043.
Quach, T.; Farooq, M. (1994). "Maximum Likelihood Track Formation with the Viterbi Algorithm". Proceedings of 33rd IEEE Conference on Decision and Control. Vol. 1. pp. 271–276. doi:10.1109/CDC.1994.410918.{{cite conference}}: CS1 maint: multiple names: authors list (link)
Qi Wang; Lei Wei; Rodney A. Kennedy (2002). "Iterative Viterbi Decoding, Trellis Shaping, and Multilevel Structure for High-Rate Parity-Concatenated TCM". IEEE Transactions on Communications. 50: 48–55. doi:10.1109/26.975743.
A fast maximum-likelihood decoder for convolutional codes (PDF). Vehicular Technology Conference. December 2002. pp. 371–375. doi:10.1109/VETECF.2002.1040367.

ieeevtc.org (Global: low place; English: low place)

A fast maximum-likelihood decoder for convolutional codes (PDF). Vehicular Technology Conference. December 2002. pp. 371–375. doi:10.1109/VETECF.2002.1040367.

mit.edu (Global: 476^th place; English: 340^th place)

people.csail.mit.edu

A fast maximum-likelihood decoder for convolutional codes (PDF). Vehicular Technology Conference. December 2002. pp. 371–375. doi:10.1109/VETECF.2002.1040367.

nih.gov (Global: 5^th place; English: 5^th place)

ncbi.nlm.nih.gov

Stanke, M.; Keller, O.; Gunduz, I.; Hayes, A.; Waack, S.; Morgenstern, B. (2006). "AUGUSTUS: Ab initio prediction of alternative transcripts". Nucleic Acids Research. 34 (Web Server issue): W435–W439. doi:10.1093/nar/gkl200. PMC 1538822. PMID 16845043.

pubmed.ncbi.nlm.nih.gov

Stanke, M.; Keller, O.; Gunduz, I.; Hayes, A.; Waack, S.; Morgenstern, B. (2006). "AUGUSTUS: Ab initio prediction of alternative transcripts". Nucleic Acids Research. 34 (Web Server issue): W435–W439. doi:10.1093/nar/gkl200. PMC 1538822. PMID 16845043.

stanford.edu (Global: 194^th place; English: 182^nd place)

ilpubs.stanford.edu

Klein, Dan; Manning, Christopher D. (2003). A* parsing: fast exact Viterbi parse selection (PDF). Proc. 2003 Conf. of the North American Chapter of the Association for Computational Linguistics on Human Language Technology (NAACL). pp. 40–47. doi:10.3115/1073445.1073461.

web.archive.org (Global: 1^st place; English: 1^st place)

Xavier Anguera et al., "Speaker Diarization: A Review of Recent Research" Archived 2016-05-12 at the Wayback Machine, retrieved 19. August 2010, IEEE TASLP