{'fraction_non_alphanumeric': 0.013392857142857142, 'fraction_numerical': 0.0, 'mean_word_length': 5.174311926605505, '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}}
Speaker verification with low storage requirements

As speaker verification continues to gain acceptance for security applications, the day is drawing near when millions of users worldwide will be using some form of speaker verification system to gain access to secure information. These accesses will most probably be via the telephone network. Within this scenario a huge data flow across long distances is expected, in order to have the speaker's templates available for verification. This paper presents initial work on reducing the data requirements for text-dependent speaker verification. It is shown how data storage and accuracy can be traded off in such systems.