Vcs Industries, Inc.

Voice Control Systems, Inc.

Alan K Hunt

Thomas Barton Schalk

The present invention describes a system and method for enabling a caller to obtain access to services via a telephone network by entering a spoken password having a plurality of digits. Preferably, the method includes the steps of: (1) prompting the caller to speak the password beginning with a first digit and ending with a last digit thereof, (2) recognizing each spoken digit of the password using a speaker-independent voice recognition algorithm, (3) following entry of the last digit of the password, determining whether the password is valid, and (4) if the password is valid, verifying the caller's identity using a voice verification algorithm.

Simultaneous voice recognition and verification to allow access to

A method for enabling a caller to obtain access to one or more services via a telephone network by speaking a password is described. The method begins by establishing at least one predetermined threshold value for a speaker verification signal. For each spoken character of the password, the method generates a set of parameters using a voice verification feature transformation. After entry and recognition of the password, the sets of parameters are used to generate a speaker verification signal for the password. Upon the occurrence of a predetermined call condition, the predetermined threshold value is adjusted to increase the level of security in the verification algorithm. If the signal verification signal for the password has a predetermined relationship with respect to the adjusted threshold value, the caller's identity is accepted. If not, the caller may be asked to answer certain personal questions before his or her identity is accepted.

Telephone network voice recognition and verification using

The present invention describes a method for recognizing alphanumeric strings spoken over a telephone network wherein individual character recognition need not be uniformly high in order to achieve high string recognition accuracy. Preferably, the method uses a processing system having a digital processor, an interface to the telephone network, and a database for storing a predetermined set of reference alphanumeric strings. In operation, the system prompts the caller to speak the characters of a string, and characters are recognized using a speaker-independent voice recognition algorithm. The method calculates recognition distances between each spoken input character and the corresponding letter or digit in the same position within each reference alphanumeric string. After each character is spoken, captured and analyzed, each reference string distance is incremented and the process is continued, accumulating distances for each reference string, until the last character is spoken. The reference string with the lowest cumulative distance is then declared to be the recognized string.

Method for continuous recognition of alphanumeric strings spoken over a

Simultaneous speaker-independent voice recognition and verification over

The present invention describes a method for recognizing alphanumeric strings spoken over a telephone network wherein individual character recognition need not be uniformly high in order to achieve high string recognition accuracy. Preferably, the method uses a processing system having a digital processor, an interface to the telephone network, and a database for storing a predetermined set of reference alphanumeric strings. In operation, the system prompts the caller to speak each character of a string, beginning with a first character and ending with a last character. Each character is then recognized using a speaker-independent voice recognition algorithm. The method calculates recognition distances between each spoken input character and the corresponding letter or digit in the same position within each reference alphanumeric string. After each character is spoken, captured and analyzed, each reference string distance is incremented and the process is continued, accumulating distances for each reference string, until the last character is spoken. The reference string with the lowest cumulative distance is then declared to be the recognized string.

Growing community of inventors

Carrollton, TX, United States of America

Alan K Hunt