{'fraction_non_alphanumeric': 0.016706443914081145, 'fraction_numerical': 0.0, 'mean_word_length': 5.169117647058823, '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}}
Similarity Search-based Blind Source Separation

In this paper, we propose a new method for blind source separation, where we perform similarity search for a prepared clean speech database. The purpose of this mechanism is to separate short utterances that we frequently encounter in a real-world situation. The new method employs a local Gaussian model (LGM) for the probability density functions of separated signals, and updates the LGM variance parameters by using the similarity search results. Experimental results show that the method performed very well in an ideal situation where we employ a close database that contains the source components used for the mixtures. In more realistic situations where an open database was used, the separation performance degraded to a certain degree, but was still better than existing methods.