{'fraction_non_alphanumeric': 0.028967254408060455, 'fraction_numerical': 0.003778337531486146, 'mean_word_length': 5.463414634146342, '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 novel efficient decoding algorithm for CDHMM-based speech recognizer on chip

The efficiency of decoding algorithm is the main limitation of realizing a CDHMM-based large-vocabulary name dialing application on consumer electronic products. To solve this problem, a novel efficient decoding algorithm, TPVD (two-pass Viterbi decoding), is represented. By coarse matching in the first pass, several high-confidence candidates are selected from hundreds. Then, fine matching in the second pass runs on base of those high-confidence candidates. Compared with traditional Viterbi beam search, the hardware resource requirement is significantly reduced. Meanwhile, the recognition accuracy and speed are satisfactory. This conclusion has been proven in an embedded Mandarin 600-name dialing system.