OPTIMAL ORDER OF MARKOV MODELS APPLIED TO BANKCHECKS

The aim of this study is to show that the optimal order of Markov Model of cursive words can be rigorously stated in order to fit the structural properties of the observed data using Akaike information criterion. The method has been tested on French Postal check amounts up to order 4. An original structural representation of cursive words based on graphemes is used. The conditional probability to have a word model given an observed sequence of graphemes is computed independently of the length of the sequence. The recognition results obtained confirm the optimal order found using Akaike criterion.