scispace - formally typeset
Journal ArticleDOI

On the Recognition of Information With a Digital Computer

Herbert T. Glantz
- 01 Apr 1957 - 
- Vol. 4, Iss: 2, pp 178-188
Reads0
Chats0
TLDR
The recognition powers of a digital computer are best demonstrated in an elementary table lookup operation, where the subject information is required to match exactly with a portion of the master list in order to be "recognized".
Abstract
There exists a vast discrepancy in the power of discrimination exercised by a digital computer and in that of a human being. The recognition of information or data patterns is a simple task for the least experienced human clerk. Most people possess sufficiently sophisticated recognition capabilities so that a variation in the pattern of the data under scrutiny will not cause undue difficulty in the discrimination process. The recognition powers of a digital computer, however, are best demonstrated in an elementary table lookup operation, wherein the subject information is required to match exactly with a portion of the master list in order to be “recognized”. Machine recognition of data which is allowed to vary from the predetermined digital pattern is a vastly more complex problem. Since digital computers are inherently devices which are capable of only YES or NO answers, all MAYBE or PERHAPS responses are obtained only through painstaking effort. If the variations in the subject data are allowed a reasonable range in both position and type, there is no complete solution of the recognition problem available with present techniques and equipments. This paper will outline the general recognition problem in terms of a set of definitions and a mathematical model. I believe that a useful formulation of the problem, and a comprehension of the difficulties involved in discrimination, are prerequisites to any effort at obtaining a complete solution to the problem of data recognition.

read more

Citations
More filters
Journal ArticleDOI

A technique for computer detection and correction of spelling errors

TL;DR: The method described assumes that a word which cannot be found in a dictionary has at most one error, which might be a wrong, missing or extra letter or a single transposition.
Journal ArticleDOI

Computer programs for detecting and correcting spelling errors

TL;DR: Peterson investigates the basic structure of several such existing programs and their approaches to solving the problems which arise when this type of program is created.
Journal ArticleDOI

Automatic spelling correction using a trigram similarity measure

TL;DR: Experiments suggest that the nearest neighbour search procedure results in the unique identification of the correct spelling for over 75% of the misspellings if the correct form of the word is in the dictionary, and that this figure may be increased to over 90% if near, rather than nearest, neighbours are acceptable.
Journal ArticleDOI

A Contextual Postprocessing System for Error Correction Using Binary n-Grams

TL;DR: Various algorithms utilizing context are considered, from a dictionary algorithm which has available the maximum amount of information, to a set of contextual algorithms utilizing positional binary n-gram statistics.

Use of context in pattern recognition.

TL;DR: A tutorial survey of techniques for using contextual information in pattern recognition is presented in this article, where the text is in the form of machine and hand printed characters, cursive script, and speech.