{'fraction_non_alphanumeric': 0.017061611374407582, 'fraction_numerical': 0.005687203791469194, 'mean_word_length': 6.087248322147651, '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}}
Structure based modern Korean character set partitioning and pre-classification method of korean character recognition

With respect to practical Korean documents, structure characteristics and structure classification of Korean character and a new pre-classification method of character recognition were studied in this paper. Firstly, the concept of character structure distance and its simple calculation method were proposed to describe the difference between structures, according to the unique linearizability of each character and the occurrence of basic graphemes. Furthermore, based on ID3 algorithm and the information gain of graphemes, the decision tree of structure classification was constructed. Finally, a decision tree based pre-classification algorithm was designed for printed character recognition. The experimental results show that basic graphemes v2, c3, v3 and v1 or c4 possess high contribution for character pre-classification, and the proposed method has reliable theoretical foundation and effective classification performance.