A Simplified Heuristic Version of Raviv's Algorithm for Using Context in Text Recognition
Proceedings of the Fifth International Joint Conference on Artificial Intelligence. Natural Language. Pages 179-179.
Abstract
Word-position-independent and word-position dependent n-gram probabilities were estimated from a large English language corpus. A textrecognition problem was simulated, and using the estimated n-gram probabilities, four experiments were conducted by the following methods of classification: without contextual information, Raviv's recursive Bayes algorithm, the modified Viterbi algorithm, and a proposed heuristic approximation to Raviv's algorithm. Based on the estimates of the probabilities of misclassification observed in the four experiments, the above methods are compared. The heuristic approximation of Raviv's algorithm performed just as well as Raviv's and required far less computation.
@inproceedings{ijcai1977p36,
title = {A Simplified Heuristic Version of Raviv's Algorithm for Using Context in Text Recognition},
author = {Schinghal, R. and Rosenberg, D. and Toussaint, Godfried T.},
booktitle = {Proceedings of the Fifth International Joint Conference on
Artificial Intelligence, {IJCAI-77}},
publisher = {International Joint Conferences on Artificial Intelligence},
editor = {Raj Reddy},
pages = {179--179},
year = {1977},
note = {Natural Language},
url = {https://ijcai.org/proceedings/1977/36},
}
TY - CPAPER TI - A Simplified Heuristic Version of Raviv's Algorithm for Using Context in Text Recognition AU - Schinghal, R. AU - Rosenberg, D. AU - Toussaint, Godfried T. T2 - Proceedings of the Fifth International Joint Conference on Artificial Intelligence, IJCAI-77 PB - International Joint Conferences on Artificial Intelligence PY - 1977 SP - 179 EP - 179 UR - https://ijcai.org/proceedings/1977/36 ER -Copied
Machine-readable versions of this paper, for tools and AI agents: