US5303299A
Expired / Lapsed
US
⏱️ 0.0 years remaining
Method for continuous recognition of alphanumeric strings spoken over a telephone network
Assignee: VSC INDUSTRIES Inc
•
Filing: 1992-06-22
•
Granted: 1994-04-12
•
Expires: 2012-06-22
Abstract
Abstract 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.
Inventors
- 👤 Alan K. Hunt
- 👤 Thomas B. Schalk
Bibliographic Details
Application Number
—
Jurisdiction
US
Data Source
google_patents
Last Synchronized
2026-10-26 11:19
CPC Classifications
G; G10; G10L; G10L17/00; G10L17/22; G10L17/24; G07; G07C; G07C9/00; G07C9/30; G07C9/32; G07C9/37; H; H04; H04M; H04M3/00; H04M3/38; H04M3/382; H04M2201/00; H04M2201/40
Claims Analysis
Total Claims: 10
Claim 1
Independent Claim
268 words
A method, using a processing system, for recognizing character strings spoken by a caller over a telephone network, the processing system including a digital processor, means for interfacing to the telephone network and storage means for storing a predetermined set of reference character strings each having at least two characters, comprising the steps of: (a) initializing a cumulative recognition distance for each of the reference character strings to zero; (b) prompting the caller to speak characters in a character string to be recognized, the character string to be recognized having at least first and second characters; (c) analyzing the character string spoken by the caller to locate a boundary between the first and second characters of the spoken character string; (d) calculating a measure of acoustical dissimilarity between the spoken first character and the first character of each of the reference character strings to generate a recognition distance for each of the reference character strings; (e) incrementing the cumulative recognition distance for each of the reference character strings by the recognition distance generated in step (d); (f) calculating a measure of acoustical dissimilarity between the spoken second character and the second character of each of the reference character strings to generate a recognition distance for each of the reference character strings; (g) incrementing the cumulative recognition distance for each of the reference character strings by the recognition distance generated in step (f); (h) determining which of the reference character strings has a lowest cumulative recognition distance; and (i) declaring the reference character string with the lowest cumulative recognition distance to be the character string spoken by the caller.
Claim 2
Independent Claim
268 words
A method, using a processing system, for recognizing character strings spoken by a caller over a telephone network, the processing system including a digital processor, means for interfacing to the telephone network and storage means for storing a predetermined set of reference character strings each having at least two characters, comprising the steps of: (a) initializing a cumulative recognition distance for each of the reference character strings to zero; (b) prompting the caller to speak characters in a character string to be recognized, the character string to be recognized having at least first and second characters; (c) analyzing the character string spoken by the caller to locate a boundary between the first and second characters of the spoken character string; (d) calculating a measure of acoustical dissimilarity between the spoken first character and the first character of each of the reference character strings to generate a recognition distance for each of the reference character strings; (e) incrementing the cumulative recognition distance for each of the reference character strings by the recognition distance generated in step (d); (f) calculating a measure of acoustical dissimilarity between the spoken second character and the second character of each of the reference character strings to generate a recognition distance for each of the reference character strings; (g) incrementing the cumulative recognition distance for each of the reference character strings by the recognition distance generated in step (f); (h) determining which of the reference character strings has a lowest cumulative recognition distance; and (i) declaring the reference character string with the lowest cumulative recognition distance to be the character string spoken by the caller.
Claim 3
Dependent Claim
17 words
The method as described in claim 1 wherein the characters of a reference character string are letters.
Claim 4
Dependent Claim
17 words
The method as described in claim 1 wherein the characters of a reference character string are digits.
Claim 5
Dependent Claim
20 words
The method as described in claim 1 wherein the characters of a reference character string include both letters and digits.
Claim 6
Independent Claim
268 words
A method, using a processing system, for recognizing character strings spoken by a caller over a telephone network, the processing system including a digital processor, means for interfacing to the telephone network and storage means for storing a predetermined set of reference character strings each having at least two characters, comprising the steps of: (a) initializing a combined recognition value for each of the reference character strings to zero; (b) prompting the caller to speak characters in a character string to be recognized, the character string to be recognized having at least first and second characters; (c) analyzing the character string spoken by the caller to locate a boundary between the first and second characters of the spoken character string; (d) calculating a measure of acoustical similarity between the spoken first character and the first character of each of the reference character strings to generate a recognition value for each of the reference character strings; (e) incrementing the combined recognition value for each of the reference character strings by the recognition value generated in step (d); (f) calculating a measure of acoustical similarity between the spoken second character and the second character of each of the reference character strings to generate a recognition value for each of the reference character strings; (g) incrementing the combined recognition value for each of the reference character strings by the recognition value generated in step (f); (h) determining which of the reference character strings has a highest combined recognition value; and (i) declaring the reference character string with the highest combined recognition value to be the character string spoken by the caller.
Claim 7
Independent Claim
268 words
A method, using a processing system, for recognizing character strings spoken by a caller over a telephone network, the processing system including a digital processor, means for interfacing to the telephone network and storage means for storing a predetermined set of reference character strings each having at least two characters, comprising the steps of: (a) initializing a combined recognition value for each of the reference character strings to zero; (b) prompting the caller to speak characters in a character string to be recognized, the character string to be recognized having at least first and second characters; (c) analyzing the character string spoken by the caller to locate a boundary between the first and second characters of the spoken character string; (d) calculating a measure of acoustical similarity between the spoken first character and the first character of each of the reference character strings to generate a recognition value for each of the reference character strings; (e) incrementing the combined recognition value for each of the reference character strings by the recognition value generated in step (d); (f) calculating a measure of acoustical similarity between the spoken second character and the second character of each of the reference character strings to generate a recognition value for each of the reference character strings; (g) incrementing the combined recognition value for each of the reference character strings by the recognition value generated in step (f); (h) determining which of the reference character strings has a highest combined recognition value; and (i) declaring the reference character string with the highest combined recognition value to be the character string spoken by the caller.
Claim 8
Dependent Claim
17 words
The method as described in claim 5 wherein the characters of a reference character string are letters.
Claim 9
Dependent Claim
17 words
The method as described in claim 5 wherein the characters of a reference character string are digits.
Claim 10
Dependent Claim
20 words
The method as described in claim 5 wherein the characters of a reference character string include both letters and digits.
References Cited (Backward Citations)
USPTO Annuity & Maintenance Windows
| Annuity Stage | Window Opens | Payment Deadline | Surcharge Period Until | Estimated Fee | Status |
|---|---|---|---|---|---|
| 3.5 Years (Year 4) | 1997-04-11 | 1997-10-11 | 1998-04-12 | $2000.00 | Window Closed / Lapsed |
| 7.5 Years (Year 8) | 2001-04-11 | 2001-10-11 | 2002-04-12 | $3760.00 | Window Closed / Lapsed |
| 11.5 Years (Year 12) | 2005-04-11 | 2005-10-11 | 2006-04-12 | $7700.00 | Window Closed / Lapsed |