{'fraction_non_alphanumeric': 0.02345215759849906, 'fraction_numerical': 0.00375234521575985, 'mean_word_length': 5.351190476190476, '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}}
An approach for spoken term detection based on modified Gaussian posteriorgrams

Query-by-Example Spoken Term Detection(QbE-STD) has been a hot research topic in speech recognition field. While template representation is the key composition part of QbE-STD, many researchers have been committed to developing effective template representations to obtain the better performance. Gaussian posteriorgram has been widely used due to that the GMM model which generates the Gaussian posteriorgram can be convenient and easy to train. However, the corresponding performance is not that satisfactory. In this paper, we use modified Gaussian posteriorgram based on the proposed Gaussian components selection algorithm as template representation, which emphasizes the discriminant among queries. The selection algorithm is inspired by the TF-IDF concept well known to the information retrieval and text indexing fields. We carried out comparison on the TIMIT corpus, and the results showed that, with our approach, the P@N was increased by 12%, and the EER was reduced by 10%.