{'fraction_non_alphanumeric': 0.019471488178025034, 'fraction_numerical': 0.0, 'mean_word_length': 4.714285714285714, '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}}
Pair-of-sequences SVM speaker verification

We present a new concept of speaker verification based on a target independent decision system. The basic principle is to build a system that decides whether two sequences were pronounced by the same speaker. In our view, this system is aimed to complement traditional ones. While the principle is quite general, in this paper we use an SVM scheme to implement it. To do so, we conceive a kernel between pair of sequences using GMM distributions estimated on each given sequence. We present experiments on NIST Speaker Recognition Evaluation. The individual performance of the new system is similar to the GLDS-SVM, and the fusion of both outperforms the baseline GMM system.