{'fraction_non_alphanumeric': 0.01348314606741573, 'fraction_numerical': 0.0, 'mean_word_length': 5.6, '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}}
A New Information Combination Approach for Character Recognition with a Limited Lexicon

This paper presents a new information combination approach for character recognition by combining the sample-based similarity measure and the posterior probabilities of DHMMs (discrete hidden Markov models). In the new method, a prototype is obtained for each class at the training stage besides an HMM. At the recognition stage, the sample similarity between an unknown sample and the prototype for a special class is calculated and normalized after feature extraction module. Then the normalized similarity measure is combined with the traditional DHMMs for classification. Experiments on off-line handwritten Chinese amount in words recognition show that the new method can effectively improve the recognition accuracy of the DHMMs-based single classifier, but the recognition speed declines little