{'fraction_non_alphanumeric': 0.04377682403433476, 'fraction_numerical': 0.005150214592274678, 'mean_word_length': 5.302702702702702, '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}}
Query-By-Example Spoken Term Detection Using Generative Adversarial Network

Several Neural Network (NN)-based representation techniques have already been proposed for Query-by-Example Spoken Term Detection (QbE-STD) task. The recent advancement in Generative Adversarial Network (GAN) for several speech technology applications, motivated us to explore the GAN in QbE-STD. In this work, we propose to exploit GAN with the regularized cross-entropy loss, and develop a framework featuring GAN, trained using Gaussian Mixture Model (GMM)-based posterior labels. The proposed GAN maps the speech-specific features to the unsupervised posterior labels. This mapping represents the speech through an unsupervised GAN posteriorgram (uGAN-PG), for matching the query (keyword) with the utterances in the document. The QbE-STD, using the proposed posteriorgram is performed on the TIMIT database. We compare the performance of the proposed uGAN-PG with the unsupervised Deep Neural Network (DNN) posteriorgram (uDNN-PG) and obtained the relative performance improvement of 10.32 % Mean Average Precision and 5.6 % Precision by considering top N queries (p@N) over uDNN-PG.