{'fraction_non_alphanumeric': 0.014754098360655738, 'fraction_numerical': 0.0, 'mean_word_length': 5.0495049504950495, '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 connected character recogniser using level building of HMMs

The recognition of a printed word is traditionally limited by its segmentation into individual characters due to the noise introduced by facsimile transmission, photocopying, handling or ageing. In this paper, a character recogniser is described which does not require a prior segmentation of the word, and is thus suited to the recognition of noisy text images. A novel method is described whereby hidden Markov models are used to recognise a horizontal "profile" of a word generated from an analysis of each vertical line of pixels in its image.