A STRING CORRECTION ALGORITHM FOR CURSIVE SCRIPT RECOGNITION

被引:11
作者
BOZINOVIC, R
SRIHARI, SN
机构
关键词
D O I
10.1109/TPAMI.1982.4767321
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
引用
收藏
页码:655 / 663
页数:9
相关论文
共 19 条
[1]   DECODING FOR CHANNELS WITH INSERTIONS, DELETIONS, AND SUBSTITUTIONS WITH APPLICATIONS TO SPEECH RECOGNITION [J].
BAHL, LR ;
JELINEK, F .
IEEE TRANSACTIONS ON INFORMATION THEORY, 1975, 21 (04) :404-411
[2]  
DEWEY G, 1923, RELATIVE FREQUENCY S
[3]   EXPERIMENTS IN CONTEXTUAL RECOGNITION OF CURSIVE SCRIPT [J].
EHRICH, RW ;
KOEHLER, KJ .
IEEE TRANSACTIONS ON COMPUTERS, 1975, C 24 (02) :182-194
[4]  
FARAG RFH, 1979, IEEE T COMPUT, V28, P172, DOI 10.1109/TC.1979.1675310
[5]   VITERBI ALGORITHM [J].
FORNEY, GD .
PROCEEDINGS OF THE IEEE, 1973, 61 (03) :268-278
[6]   APPROXIMATE STRING MATCHING [J].
HALL, PAV ;
DOWLING, GR .
COMPUTING SURVEYS, 1980, 12 (04) :381-402
[7]  
Jelinek F., 1969, IBM Journal of Research and Development, V13, P675, DOI 10.1147/rd.136.0675
[8]   AN EFFECTIVE ALGORITHM FOR STRING CORRECTION USING GENERALIZED EDIT DISTANCES .1. DESCRIPTION OF THE ALGORITHM AND ITS OPTIMALITY [J].
KASHYAP, RL ;
OOMMEN, BJ .
INFORMATION SCIENCES, 1981, 23 (02) :123-142
[9]   AN EFFECTIVE ALGORITHM FOR STRING CORRECTION USING GENERALIZED EDIT DISTANCES .2. COMPUTATIONAL-COMPLEXITY OF THE ALGORITHM AND SOME APPLICATIONS [J].
KASHYAP, RL ;
OOMMEN, BJ .
INFORMATION SCIENCES, 1981, 23 (03) :201-217
[10]  
Knuth D. E., 1973, ART COMPUTER PROGRAM