{'fraction_non_alphanumeric': 0.0257847533632287, 'fraction_numerical': 0.008968609865470852, 'mean_word_length': 5.424460431654676, '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 COMPARATIVE STUDY OF STROKE CORRESPONDENCE SEARCH ALGORITHMS FOR ONLINE KANJI CHARACTER RECOGNITION

The stroke to stroke correspondence search between an input character and a reference character plays an important role in stroke-order-free online Kanji character recognition. It has a vital influence on the recognition performance. Various stroke correspondence algorithms have been proposed, and official comparative studies for clarifying the relative superiority of those algorithms are hoped for. As the first stage of the studies, two typical algorithms ― the cube search method (CS) and a method based on stable marriage (SM) ―are experimentally compared, mainly in regard of recognition accuracy. The experimental results show that 99.10% and 97.58% recognition rates were attained by CS and SM, respectively. Additionally, we discuss the performance difference between CS and SM.