Existing literature reveals that during reading, gaze fixations within a word are not necessarily close to the optimal reading position. The optimal position for reading represents the gaze fixation near the center of each word for which recognition time is minimal. In our study, we examined the match between optimal position and initial fixation position, which has not been studied before. We ...

In this paper we prove that, if V is a κ-tame pseudovariety which satisfies the pseudoidentity xyz = xyz, then the pseudovariety join LSl∨V is also κ-tame. Here, LSl denotes the pseudovariety of local semilattices and κ denotes the implicit signature consisting of the multiplication and the (ω − 1)-power. As a consequence, we deduce that LSl ∨V is decidable. In particular the joins LSl ∨ Ab, LS...

Stroke extraction is of great significance for an offline character recognition system. In this paper, we present an efficient stroke extraction method based on a combination of a simple feature point detection scheme and a novel stroke segment connecting method. The algorithm can fast and accurately extract the strokes from the thinned Chinese character images. Experimental results on a large ...

Optical Character Recognition (OCR) document. WARNING! Spelling errors might subsist. In order to access to the original document in image form, click on "Original" button on 1st page.

A novel technique is presented here for recognition of handwritten compound characters of Bangla alphabet. It advocates for incrementally expanding the number of learned character classes from more frequently occurred to less frequently occurred ones. The work is preceded by a survey for finding the frequencies of occurrences of all Bangla characters in the standard literature. One important fi...

Machine recognition of hand-printed Japanese characters has been an area of great interest for many years. The major problem with this classification task is the huge number of different characters. Applying standard ”state-ofthe-art” techniques, such as the SVM, to multi-class problems of this kind imposes severe problems, both of a conceptual and a technical nature: (i) separating one class f...

Here we describe a framework built upon Tesseract optical character recognition software for transcribing old texts having non-standard fonts. Further, we illustrate our software on creating a digital version of two volumes of a 17 century French text. The volumes consist of 808 pages having 84,366 words, and our system initially correctly transcribes 88% of the words. Further, we identify a me...

ed so that, in session 2, the degradation of the test stimulus does not prolong the comparison operation. This conclusion follows from the virtual equality of the slopes of the two reaction-time functions in that session. The marked effect of degradation on reaction time is due, in both sessions, primarily to a change in some part of the process other than the comparison operation. It is plausi...

Spelling correction techniques can be used to improve the recognition accuracy of text recognition systems. In this paper a new spelling-error model is proposed that is especially suited to the correction of recognition errors occurring during the recognition of printed documents. An implementation of this model is described that exploits typographical constraints derived from character shapes....