US5075896A
Expired / Lapsed
US
⏱️ 0.0 years remaining
Character and phoneme recognition based on probability clustering
Assignee: Xerox Corp
•
Filing: 1989-10-25
•
Granted: 1991-12-24
•
Expires: 2009-10-25
Abstract
Abstract Prior to character or phoneme recognition, a classifier provides a respective probability list for each of a sequence of sample characters or phonemes, each probability list indicating the respective sample's probability for each character or phoneme type. These probability lists are clustered in character or phoneme probability space, in which each dimension corresponds to the probability that a character or phoneme candidate is an instance of a specific character or phoneme type. For each resulting cluster, data is stored indicating its cluster ID and a probability list indicating the probability of each type at the cluster's center. Then, during recognition, a probability cluster identifier compares the probability list for each candidate with the probability list for each cluster to find the nearest cluster. The cluster identifier then provides the nearest cluster's cluster ID to a constraint satisfier that attempts to recognize the candidate based on rules, patterns, or a combination of rules and patterns. If necessary, the constraint satisfier uses the cluster ID to retrieve the stored probability list of the cluster to assist it in recognition.
Inventors
- 👤 Lynn D. Wilcox
- 👤 A. Lawrence Spitz
Bibliographic Details
Application Number
—
Jurisdiction
US
Data Source
google_patents
Last Synchronized
2026-10-25 16:55
CPC Classifications
G; G10; G10L; G10L15/00; G10L15/08; G10L15/18; G10L15/183; G10L15/187
Claims Analysis
Total Claims: 30
Claim 1
Independent Claim
130 words
A method comprising steps of: obtaining a set of probability values for a character candidate, the set of probability values including a respective probability value for each of a set of character types, each character type's probability value indicating a probability that the character candidate is an instance of the character type; and using the set of probability values to identify which of a number of character probability clusters is nearest to the candidate; the character probability clusters being regions of a space; the space having a respective dimension for each of the character types; the character candidate's respective probability value for each character type indicating the character candidate's position in the character type's dimension so that the set of probability values define the character candidate's position in the space.
Claim 2
Independent Claim
130 words
A method comprising steps of: obtaining a set of probability values for a character candidate, the set of probability values including a respective probability value for each of a set of character types, each character type's probability value indicating a probability that the character candidate is an instance of the character type; and using the set of probability values to identify which of a number of character probability clusters is nearest to the candidate; the character probability clusters being regions of a space; the space having a respective dimension for each of the character types; the character candidate's respective probability value for each character type indicating the character candidate's position in the character type's dimension so that the set of probability values define the character candidate's position in the space.
Claim 3
Dependent Claim
32 words
The method of claim 1, further comprising a step of storing respective probability data for each of the character probability clusters prior to the step of using the set of probability values.
Claim 4
Dependent Claim
23 words
The method of claim 2 in which the storing step comprises clustering sample probability data in order to obtain the character probability clusters.
Claim 5
Dependent Claim
25 words
The method of claim 2, further comprising a step of recognizing the candidate based on the respective probability data for the identified nearest probability cluster.
Claim 6
Dependent Claim
39 words
The method of claim 3 in which the respective probability data of each cluster is a set of probability values, the set of probability values including a respective probability value for each of a set of recognizable character types.
Claim 7
Dependent Claim
52 words
The method of claim 1 in which the step of using the set of probability values comprises a substep of obtaining data identifying the nearest probability cluster, the method further comprising a step of obtaining data identifying a character type of the candidate character based on the data identifying the nearest cluster.
Claim 8
Dependent Claim
15 words
The method of claim 6 in which the cluster identifying data is a cluster ID.
Claim 9
Independent Claim
164 words
A system comprising: a classifier for providing a set of probability values for a character candidate; the set of probability values including a respective probability value for each of a set of character types, each character type's probability value indicating a probability that the character candidate is an instance of the character type; a probability cluster identifier for using the set of probability values to produce data identifying which of a number of character probability clusters is nearest to the character candidate; the character probability clusters being regions of a space; the space having a respective dimension for each of the character types; the character candidate's respective probability value for each character type indicating the character candidate's position in the character type's dimension so that the set of probability values define the character candidate's position in the space; and a constraint satisfier for providing data identifying a character type of the character candidate based on the cluster identifying data from the probability cluster identifier.
Claim 10
Independent Claim
164 words
A system comprising: a classifier for providing a set of probability values for a character candidate; the set of probability values including a respective probability value for each of a set of character types, each character type's probability value indicating a probability that the character candidate is an instance of the character type; a probability cluster identifier for using the set of probability values to produce data identifying which of a number of character probability clusters is nearest to the character candidate; the character probability clusters being regions of a space; the space having a respective dimension for each of the character types; the character candidate's respective probability value for each character type indicating the character candidate's position in the character type's dimension so that the set of probability values define the character candidate's position in the space; and a constraint satisfier for providing data identifying a character type of the character candidate based on the cluster identifying data from the probability cluster identifier.
Claim 11
Dependent Claim
19 words
The system of claim 8 in which the probability cluster identifier produces a cluster ID identifying the nearest cluster.
Claim 12
Dependent Claim
40 words
The system of claim 8, further comprising stored probability data including respective probability data for each of the character probability clusters, the constraint satisfier using the cluster identifying data to access the respective probability data of the identified nearest cluster.
Claim 13
Dependent Claim
42 words
The system of claim 10 in which the respective probability data for each cluster includes a respective set of probability values for the cluster, each cluster's respective set of probability values including a respective probability value for each of the character types.
Claim 14
Dependent Claim
51 words
The system of claim 10 in which the classifier is further for providing respective probability data for a set of sample characters; the system further comprising a trainer for storing the respective probability data for each of the character probability clusters based on the respective probability data for the sample characters.
Claim 15
Dependent Claim
36 words
The system of claim 12 in which the trainer is further for obtaining the character probability clusters and the respective probability data for each of the clusters by clustering the probability data for the sample characters.
Claim 16
Independent Claim
131 words
A method comprising steps of: obtaining a set of probability values for a phoneme candidate, the set of probability values including a respective probability value for each of a set of phoneme types, each phoneme type's probability value indicating a respective probability that the phoneme candidate is an instance of the phoneme type; and using the set of probability values to identify which of a number of phoneme probability clusters is nearest to the candidate; the phoneme probability clusters being regions of a space; the space having a respective dimension for each of the phoneme types; the phoneme candidate's respective probability value for each phoneme type indicating the phoneme candidate's position in the phoneme type's dimension so that the set of probability values define the phoneme candidate's position in the space.
Claim 17
Independent Claim
131 words
A method comprising steps of: obtaining a set of probability values for a phoneme candidate, the set of probability values including a respective probability value for each of a set of phoneme types, each phoneme type's probability value indicating a respective probability that the phoneme candidate is an instance of the phoneme type; and using the set of probability values to identify which of a number of phoneme probability clusters is nearest to the candidate; the phoneme probability clusters being regions of a space; the space having a respective dimension for each of the phoneme types; the phoneme candidate's respective probability value for each phoneme type indicating the phoneme candidate's position in the phoneme type's dimension so that the set of probability values define the phoneme candidate's position in the space.
Claim 18
Dependent Claim
32 words
The method of claim 14, further comprising a step of storing respective probability data for each of the phoneme probability clusters prior to the step of using the set of probability values.
Claim 19
Dependent Claim
23 words
The method of claim 15 in which the storing step comprises clustering sample probability data in order to obtain the phoneme probability clusters.
Claim 20
Dependent Claim
25 words
The method of claim 15, further comprising a step of recognizing the candidate based on the respective probability data for the identified nearest probability cluster.
Claim 21
Dependent Claim
39 words
The method of claim 15 in which the respective probability data of each cluster is a set of probability values, the set of probability values including a respective probability value for each of a set of recognizable phoneme types.
Claim 22
Dependent Claim
51 words
The method of claim 14 in which the step of using the set of probability values comprises a substep of obtaining data identifying the nearest probability cluster, the method further comprising a step of obtaining data identifying a phoneme type of the candidate based on the data identifying the nearest cluster.
Claim 23
Dependent Claim
15 words
The method of claim 19 in which the cluster identifying data is a cluster ID.
Claim 24
Independent Claim
164 words
A system comprising: a classifier for providing a set of probability values for a phoneme candidate; the set of probability values including a respective probability value for each of a set of phoneme types, each phoneme type's probability value indicating a probability that the phoneme candidate is an instance of the phoneme type; a probability cluster identifier for using the set of probability values to produce data identifying which of a number of phoneme probability clusters is nearest to the phoneme candidate; the phoneme probability clusters being regions of a space; the space having a respective dimension for each of the phoneme types; the phoneme candidate's respective probability value for each phoneme type indicating the phoneme candidate's position in the phoneme type's dimension so that the set of probability values define the phoneme candidate's position in the space; and a constraint satisfier for providing data identifying a phoneme type of the phoneme candidate based on the cluster identifying data from the probability cluster identifier.
Claim 25
Independent Claim
164 words
A system comprising: a classifier for providing a set of probability values for a phoneme candidate; the set of probability values including a respective probability value for each of a set of phoneme types, each phoneme type's probability value indicating a probability that the phoneme candidate is an instance of the phoneme type; a probability cluster identifier for using the set of probability values to produce data identifying which of a number of phoneme probability clusters is nearest to the phoneme candidate; the phoneme probability clusters being regions of a space; the space having a respective dimension for each of the phoneme types; the phoneme candidate's respective probability value for each phoneme type indicating the phoneme candidate's position in the phoneme type's dimension so that the set of probability values define the phoneme candidate's position in the space; and a constraint satisfier for providing data identifying a phoneme type of the phoneme candidate based on the cluster identifying data from the probability cluster identifier.
Claim 26
Dependent Claim
19 words
The system of claim 21 in which the probability cluster identifier produces a cluster ID identifying the nearest cluster.
Claim 27
Dependent Claim
40 words
The system of claim 21, further comprising stored probability data including respective probability data for each of the phoneme probability clusters, the constraint satisfier using the cluster identifying data to access the respective probability data of the identified nearest cluster.
Claim 28
Dependent Claim
42 words
The system of claim 23 in which the respective probability data for each cluster includes a respective set of probability values for the cluster, each cluster's respective set of probability values including a respective probability value for each of the phoneme types.
Claim 29
Dependent Claim
51 words
The system of claim 23 in which the classifier is further for providing respective probability data for a set of sample phonemes; the system further comprising a trainer for storing the respective probability data for each of the phoneme probability clusters based on the respective probability data for the sample phonemes.
Claim 30
Dependent Claim
36 words
The system of claim 25 in which the trainer is further for obtaining the phoneme probability clusters and the respective probability data for each of the clusters by clustering the probability data for the sample phonemes.
References Cited (Backward Citations)
US3643215A
Cited
US3810162A
Cited
US3755780A
Cited
US3969698A
Cited
US4180799A
Cited
US4541115A
Cited
US4783804A
Cited
US4773099A
Cited
US4903305A
Cited
US4837831A
Cited
EP0283266A2
Cited
US4958375A
Cited
EP0370766A2
Cited
USPTO Annuity & Maintenance Windows
| Annuity Stage | Window Opens | Payment Deadline | Surcharge Period Until | Estimated Fee | Status |
|---|---|---|---|---|---|
| 3.5 Years (Year 4) | 1994-12-23 | 1995-06-24 | 1995-12-24 | $2000.00 | Window Closed / Lapsed |
| 7.5 Years (Year 8) | 1998-12-23 | 1999-06-24 | 1999-12-24 | $3760.00 | Window Closed / Lapsed |
| 11.5 Years (Year 12) | 2002-12-23 | 2003-06-24 | 2003-12-24 | $7700.00 | Window Closed / Lapsed |