Cursive script recognition applied to the processing of bank cheques

A method for recognizing unconstrained handwritten words belonging to a small static lexicon is proposed. Our computational theory is based on a psychological model of the reading process of a fast reader. The method we propose is global in its nature and avoid the difficult segmentation stage of common word recognition techniques. Our computational theory has been applied to the processing of handwritten bank cheques, whose problem domain is that of unconstrained handwriting, unlimited writers in a small static lexicon. Current results seem comparable to those published in the literature and support our computational theory