{'fraction_non_alphanumeric': 0.016331658291457288, 'fraction_numerical': 0.0, 'mean_word_length': 5.532786885245901, '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}}
Reconstructing dynamic font-based Chinese characters using support vector machine

This paper considers a problem of reconstructing a typeface of Chinese characters. First, Chinese characters are generated by using the so-called dynamic font method as a basic tool. Then, we develop a scheme for reconstructing characters to cursive characters with natural "Renmen" which can depict continuity of the adjacent strokes. For realizing the natural Renmen, we propose a method for judging stroke connectivity by introducing kernel support vector machine when we reconstruct the character. It is shown that the reconstruction problem is formulated as a smoothing spline problem with constraints expressed in terms of stroke connectivity. The performances are demonstrated by some experimental studies.