{'fraction_non_alphanumeric': 0.016666666666666666, 'fraction_numerical': 0.0011904761904761906, 'mean_word_length': 5.276119402985074, '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}}
Finite State Machine Based Decoding of Handwritten Text Using Recurrent Neural Networks

This paper presents a Finite State Machine (FSM) to reduce user's waiting time to get the recognition result after finishing writing in recognition of online handwritten English text. The lexicon is modeled by a FSM, and then determination and minimization are applied to reduce the number of states. The reduction of states in the FSM shortens the waiting time without degrading the recognition accuracy. Moreover, by merging incoming paths to each state, the recognition rate is improved. The N-best states decoding method also reduces the waiting time significantly with small degradation in recognition accuracy. Experiments on IAM-OnDB and IBM_UB_1 show the effectiveness of the method in both reducing waiting and improving recognition accuracy.