{'fraction_non_alphanumeric': 0.02109375, 'fraction_numerical': 0.0, 'mean_word_length': 5.671875, '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}}
Efficient recognition of continuously-spoken numbers

Automatic recognition of continuously-spoken numbers (e.g., telephone or credit card digit sequences) is possible with excellent accuracy, even in applications using telephone lines and serving a large population. However, even such simple recognition tasks suffer decreased performance in adverse conditions, e.g., significant background noise or fading on portable telephone channels. If we further impose significant limitations on the computing resources for the recognition task, then robust efficient speech recognition is still a significant challenge, even for a vocabulary as simple as the digits. Since connected-digit recognition over telephone lines has very practical applications. The amount of computer resources needed for a given level of recognition accuracy is investigated. Rather than use a traditional hidden Markov model approach with cepstral analysis, which is computationally intensive and does not always work well under adverse acoustic conditions, a simpler spectral analysis is used, combined with a segmental approach. The restricted nature of the digit vocabulary allows this simpler approach. High recognition accuracy can be maintained despite a large decrease in both memory and computation.