The Community for Technology Leaders
RSS Icon
Issue No.04 - April (1971 vol.20)
pp: 397-403
This paper describes a special-purpose character recognition system which uses contextual information for the recognition of words from any given dictionary of words. Previous techniques that utilized context involved letter transition probabilities of digrams and trigrams. This research introduces the concept of binary digrams which overcomes some of the problems of past approaches. They can be used to extract offectively the "syntax" of the dictionary while requiring very modest amounts of storage. A computationally feasible procedure is described which allows the accuracy requirements of the character recognizer to be relaxed if it is followed by a contextual postprocessor. The modified recognition system is allowed to output several alternatives for each character, while the postprocessor selects the proper string of characters by having access to both the dictionary and the dictionary syntax. A theoretical estimate of the recognition rate is derived, and experimental results demonstrate the ability of the system to achieve low error and rejection rates.
Admissible sequences, binary digrams, context, dictionary, pattern recognition, postprocessor, special-purpose character recognizer, syntax.
E.M. Riseman, R.W. Ehrich, "Contextual Word Recognition Using Binary Digrams", IEEE Transactions on Computers, vol.20, no. 4, pp. 397-403, April 1971, doi:10.1109/T-C.1971.223255
6 ms
(Ver 2.0)

Marketing Automation Platform Marketing Automation Tool