| On the independence of digits in connected digit strings |
Title: On the independence of digits in connected digit strings
Author(s): Johan Koolwaaij & Lou Boves
Reference: Proceedings of the "5th European conference on speech communication and technology" (EUROSPEECH'97), Rhodes, Vol.5, pp. 2351-2354, 1997
Keywords: Speaker Recognition
There is a PostScript version (204118 bytes) available.
One of the frequently used assumptions in Speaker Verification
is that two speech segments (phonemes, subwords, words) are considered
to be independent. And therefore, the log-likelihood of a test utterance
is just the sum of the log-likelihoods of the speech segments in that
utterance. This paper reports about cases in which this observation-independence
assumption seems to be violated, namely for those test utterances which
call a certain speech model more than once. For example, a pin code which
contains a non-unique digit set performs worse in verification than a pin code
which consists of four different digits. Results illustrate that violating the
independence assumption too much might result in increasing EERs while more
information (in form of digits) is added to the test utterance.
Error processing SSI file