Experiments in Text Recognition with Binary n-Gram and Viterbi Algorithms
- 1 September 1982
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- Vol. PAMI-4 (5) , 520-530
- https://doi.org/10.1109/tpami.1982.4767297
Abstract
The binary n-gram and Viterbi algorithms have been suggested as alternative approaches to contextual postprocessing for text produced by a noisy channel such as an optical character recognizer. This correspondence describes the underlying theory of each approach in unified terminology, and presents new implementation algorithms for each approach. In particular, a storage efficient data structure is proposed for the binary n-gram algorithm and a recursive formulation is given for the Viterbi algorithm. Results of extensive experiments with each algorithm are described.Keywords
This publication has 13 references indexed in Scilit:
- Integrating diverse knowledge sources in text recognitionPublished by Association for Computing Machinery (ACM) ,1982
- Computer programs for detecting and correcting spelling errorsCommunications of the ACM, 1980
- Approximate String MatchingACM Computing Surveys, 1980
- n-Gram Statistics for Natural Language Understanding and Text ProcessingIEEE Transactions on Pattern Analysis and Machine Intelligence, 1979
- Experiments in Text Recognition with the Modified Viterbi AlgorithmIEEE Transactions on Pattern Analysis and Machine Intelligence, 1979
- A bottom-up and top-down approach to using context in text recognitionInternational Journal of Man-Machine Studies, 1979
- A binary n-gram technique for automatic correction of substitution, deletion, insertion and reversal errors in wordsThe Computer Journal, 1977
- A Contextual Postprocessing System for Error Correction Using Binary n-GramsIEEE Transactions on Computers, 1974
- The viterbi algorithmProceedings of the IEEE, 1973
- Contextual Word Recognition Using Binary DigramsIEEE Transactions on Computers, 1971