摘要 |
PCT No. PCT/GB91/01681 Sec. 371 Date Apr. 5, 1993 Sec. 102(e) Date Apr. 5, 1993 PCT Filed Sep. 30, 1991 PCT Pub. No. WO92/06468 PCT Pub. Date Apr. 16, 1992.Speaker verification is important in such applications as financial transactions which are to be carried out automatically by telephone. False acceptances of a speaker cause serious problems but so do frequent false rejections in view of the annoyance caused. Some of the problems of speaker verification are reduced in the invention by forming Hidden Markov Models (HMMs) for each of a number of words using features of utterances of these words from a large number of speakers. These models are known as world models. In addition, for every person whose speech is to be recognized, one HMM is formed for each of the words as uttered by that person. These models are known as personal models. In verification, a person is prompted to repeat a string of isolated or connected words (15) and features from each of these words are extracted (16). Next, the probabilities that these features could have been generated by the world models for these words and by the personal model of that person are calculated, respectively (17 and 18) and these probabilities are compared (19) for each word. A decision (23) on verification is based on a poll (22) of these comparisons. |