{'fraction_non_alphanumeric': 0.022727272727272728, 'fraction_numerical': 0.0, 'mean_word_length': 5.082872928176796, '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 new robust LPCCS for speech recogniton in channel distortion environments

Linear Prediction (LP) analysis plays an important role in speech processing. Linear Prediction Cepstral Coefficients (LPCCs) are proved to be better features for speech recognition. In LP analysis, the generation of speech is modeled with an autoregressive (AR) random process. In fact, speech from vocal cord goes through vocal tract first, and then goes through channel. However, general LP analysis does not consider the effect of channel and the LPCCs show little robustness in speech recognition under channel distortion. In this paper, distorted speech is modeled by two different AR models which denote vocal tract and channel, respectively. After the poles are computed, K-means is used to cluster all poles and a new method is proposed to choose Channel poles. For each frame of test utterances, instead of designing a filter using channel poles, robust LPCCs are computed directly by removing channel poles from all poles. Experiment shows that this approach can obtain a better performance than general methods.