{'fraction_non_alphanumeric': 0.012058570198105082, 'fraction_numerical': 0.0, 'mean_word_length': 5.4916201117318435, '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}}
Clustering acoustic prototypes with self organizing distortion measures

Selection of acoustic prototypes is an important aspect of speech recognition systems. In this paper a new algorithm for obtaining a set of acoustic prototypes is described. Associated with each prototype is a distortion measure whose full quadratic distance form is optimized to achieve a local minimum for the average distortion. Using a K-means clustering strategy, it is shown that in each iteration the minimum is achieved when the eigenvectors of the weighting matrices of the qudratic distances are identical to those of the sample covariance matrices of their corresponding clusters. Under certain eigenvalue constraints, closed form solutions for finding the eigenvalues are provided. Furtheremore, it is shown that clustering schemes that assume a multivariate Gaussian mixture density for the data can be solved using the new technique. Thereby, a new derivation for the maximum likelihood estimate of their associated covariance matrices is presented. Finally, recognition results obtained by incorporating the new algorithm in the IBM Speech Recognition system are presented.