{'fraction_non_alphanumeric': 0.009523809523809525, 'fraction_numerical': 0.0, 'mean_word_length': 5.331325301204819, 'pattern_counts': {'":': 0, '<': 0, '<?xml version=': 0, '>': 0, 'https://': 0, 'lorem ipsum': 0, 'www.': 0, 'xml': 0}, 'pii_count': 0, 'substrings_counts': 0, 'word_list_counts': {'cursed_substrings.json': 0, 'profanity_word_list.json': 0, 'sexual_word_list.json': 0, 'zh_pornsignals.json': 0}}
Fast discrete HMM algorithm for online handwriting recognition

A fast discrete HMM algorithm is proposed for online handwritten character recognition. After preprocessing the input strokes are discretized so that a discrete HMM is used. This particular discretization naturally leads to a simple procedure for assigning initial state and state transition probabilities. In the training phase, complete marginalization with respect to state is not performed. A criterion based on normalized maximum likelihood ratio is given for deciding when to create a new model for the same character in the learning phase, in order to cope with stroke order variations and large shape variations. Experiments were done on the Kuchibue database from TUAT. The algorithm was shown to be very robust against stroke number variations and was reasonable robustness against stroke order variations and large shape variations. A drawback of the proposed algorithm is its memory requirement when the number of character classes and their associated models becomes large.