메뉴 건너뛰기




Volumn 23, Issue 3-4, 1990, Pages 337-346

A review of segmentation and contextual analysis techniques for text recognition

Author keywords

Contextual processing; Dictionary structure; Levenshtein Distance N gram techniques; Markov methods; Text processing; Text recognition; Text segmentation; Viterbi Algorithm

Indexed keywords

CHARACTER RECOGNITION; CHARACTER RECOGNITION, OPTICAL; COMPUTER VISION;

EID: 0025198769     PISSN: 00313203     EISSN: None     Source Type: Journal    
DOI: 10.1016/0031-3203(90)90021-C     Document Type: Article
Times cited : (65)

References (58)
  • 2
    • 0019009104 scopus 로고
    • Automatic recognition of handprinted characters - the state of the art
    • 2nd edn, (4)
    • (1980) Proc. IEEE , vol.68 , pp. 469-487
    • Suen1    Berthod2    Mori3
  • 21
    • 0015600423 scopus 로고
    • The Viterbi Algorithm
    • 2nd edn, (3)
    • (1973) Proc. IEEE , vol.61 , pp. 268-278
    • Forney1
  • 30
    • 0010111194 scopus 로고
    • A binary N-gram technique for automatic correction of substitution deletion insertion and reversal errors in words
    • (1977) The Computer Journal , vol.20 , pp. 141-147
    • Ullman1
  • 32
    • 0001116877 scopus 로고
    • Binary codes capable of correcting deletions, insertions, and reversals
    • (1966) Sov. Phys. Dokl. , vol.10 , Issue.8 , pp. 707-710
    • Levenshtein1
  • 35
    • 0015960104 scopus 로고
    • The string to string correction problem
    • (1974) J. ACM , vol.21 , Issue.1 , pp. 168-173
    • Wagner1    Fischer2
  • 36
    • 0016494974 scopus 로고
    • An extension of the string to string correction problem
    • (1975) J. ACM , vol.22 , Issue.2 , pp. 173-183
    • Lowrance1    Wagner2
  • 45
    • 0018031684 scopus 로고
    • Median split trees: a fast lookup technique for frequently occurring keys
    • (1978) Commun. ACM , vol.21 , Issue.11 , pp. 947-958
    • Sheil1


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.