VITERBI ALGORITHM AS AN AID IN TEXT RECOGNITION

被引：46

作者：

NEUHOFF, DL

机构：

[1] UNIV MICHIGAN, DEPT ELECT & COMP ENGN, COMP INFORMATION & CONTROL ENGN PROGRAM, ANN ARBOR, MI 48104 USA

[2] STANFORD UNIV, ELECT ENGN DEPT, STANFORD, CA USA

来源：

IEEE TRANSACTIONS ON INFORMATION THEORY | 1975年 / 21卷 / 02期

关键词：

D O I：

10.1109/TIT.1975.1055355

中图分类号：

TP [自动化技术、计算机技术];

学科分类号：

0812 ;

摘要：

引用

页码：222 / 226

页数：5

共 13 条

[1] LETTER STRUCTURE OF THE ENGLISH LANGUAGE [J].

BADDELEY, AD ;

CONRAD, R ;

THOMSON, WE .

NATURE, 1960, 186 (4722) :414-416

[2] ADVNACES IN PATTERN RECOGNITION [J].

CASEY, RG ;

NAGY, G .

SCIENTIFIC AMERICAN, 1971, 224 (04) :56-&

[3] VITERBI ALGORITHM [J].

FORNEY, GD .

PROCEEDINGS OF THE IEEE, 1973, 61 (03) :268-278

[4]

FORNEY GD, 1971, AUG STANF EL LAB STA

[5]

GALLAGER RG, 1968, INFORMATION THEORY R, P77

[6]

MAYZNER MS, 1965, PSYCHONOMIC MONOGRAP, V1

[7]

PRATT F, 1939, SECRET URGENT

[8] DECISION MAKING IN MARKOV CHAINS APPLIED TO PROBLEM OF PATTERN RECOGNITION [J].

RAVIV, J .

IEEE TRANSACTIONS ON INFORMATION THEORY, 1967, 13 (04) :536-+

[9]

RAVIV J, UNPUBLISHED

[10] CONTEXTUAL WORD RECOGNITION USING BINARY DIGRAMS [J].

RISEMAN, EM ;

EHRICH, RW .

IEEE TRANSACTIONS ON COMPUTERS, 1971, C 20 (04) :397-+

← 1 2 →