← Back to Patent Explorer
US5202952A Expired / Lapsed US ⏱️ 0.0 years remaining

Large-vocabulary continuous speech prefiltering and processing system

Assignee: Nuance Communications Inc
•
Filing: 1990-06-22
•
Granted: 1993-04-13
•
Expires: 2010-06-22
📄 Original PDF 🌐 Google Patents 🔄 Sync Now

Abstract

Abstract A continuous speech prefiltering system for use in continuous speech recognition computer systems. The speech to be recognized is converted from utterances to frame data sets, which frame data sets are smoothed to generate a smooth frame model over a predetermined number of frames. A resident vocabulary is stored within the computer as clusters of word models which are acoustically similar over a succession of frame periods. A cluster score is generated by the system, which score includes the likelihood of the smooth frames evaluated using a probability model for the cluster against which the smooth frame model is being compared. Cluster sets having cluster scores below a predetermined acoustic threshold are removed from further consideration. The remaining cluster sets are unpacked for determination of a word score for each unpacked word. These word scores are used to identify those words which are above a second predetermined threshold to define a word list which is sent to a recognizer for a more lengthy word match. A controller enables the system to initialize times corresponding to the frame start time for each frame data set, defining a sliding window.

Inventors

  • 👤 Laurence S. Gillick
  • 👤 Robert S. Roth

Bibliographic Details

Application Number —
Jurisdiction US
Data Source google_patents
Last Synchronized 2026-10-27 21:16
CPC Classifications
G; G10; G10L; G10L15/00; G10L15/08; G10L15/10

Claims Analysis

Total Claims: 31
Claim 1
Independent Claim 118 words
A system for processing continuous speech, said speech including a succession of utterances, comprising: A. means for storing a plurality of word models; B. means for identifying a succession of temporal segments of said utterances; C. means selectively operable on ones of said segments for identifying a subset of said plurality of word models meeting predetermined criteria, said subset defining a list of candidate words; D. control means for determining arbitrarily selected frame start times t during said utterances, said frame start times being independent of identification of an initial anchor; and E. means for generating a signal representative of said list of candidate words for selected ones of said frame start times t determined in step D.
Claim 2
Independent Claim 118 words
A system for processing continuous speech, said speech including a succession of utterances, comprising: A. means for storing a plurality of word models; B. means for identifying a succession of temporal segments of said utterances; C. means selectively operable on ones of said segments for identifying a subset of said plurality of word models meeting predetermined criteria, said subset defining a list of candidate words; D. control means for determining arbitrarily selected frame start times t during said utterances, said frame start times being independent of identification of an initial anchor; and E. means for generating a signal representative of said list of candidate words for selected ones of said frame start times t determined in step D.
Claim 3
Dependent Claim 337 words
A prefiltering system for processing continuous speech, said speech including a succession of utterances, comprising: A. cluster data storage means for storing a plurality of M cluster data sets, C 1 , . . . , C M , where M is an integer greater than 1, each of said cluster data sets including data representative of a plurality of word models; B. frame data means for generating succession of w frame data sets v t , v t +1, . . . v t +w-1, beginning at a frame start time t during said succession of utterances, where w is an integer greater than 1, said succession of frame data sets being representative of a corresponding succession of temporal segments of said utterances, each of said frame data sets including k values representative of different frame parameters, where k≧1; C. data reduction means selectively operable on said w frame data sets for generating s reduced frame data sets where s<w, each of said reduced frame data sets Y 1 , Y 2 , . . . , Y 3 , being related to an associated plurality of said frame data sets and including j values representative of different reduced frame data set parameters; D. scoring means for evaluating each of said reduced frame data sets against a succession of said cluster data sets to generate a cluster score S Y for each of said cluster data sets; E. selectively operable identifying means for identifying each of said word models of said cluster data sets having a cluster score bearing a predetermined relation to at least one threshold score T, said identified word models defining a candidate word list; F. control means for determining said frame start times t, where successive start times t are spaced apart arbitrarily, said frame start times being independent of identification of an initial anchor; and G. means for generating a signal representative of said candidate word list for preselected ones of said frame start times t determined by said control means.
Claim 4
Dependent Claim 337 words
A prefiltering system for processing continuous speech, said speech including a succession of utterances, comprising: A. cluster data storage means for storing a plurality of M cluster data sets, C 1 , . . . , C M , where M is an integer greater than 1, each of said cluster data sets including data representative of a plurality of word models; B. frame data means for generating succession of w frame data sets v t , v t +1, . . . v t +w-1, beginning at a frame start time t during said succession of utterances, where w is an integer greater than 1, said succession of frame data sets being representative of a corresponding succession of temporal segments of said utterances, each of said frame data sets including k values representative of different frame parameters, where k≧1; C. data reduction means selectively operable on said w frame data sets for generating s reduced frame data sets where s<w, each of said reduced frame data sets Y 1 , Y 2 , . . . , Y 3 , being related to an associated plurality of said frame data sets and including j values representative of different reduced frame data set parameters; D. scoring means for evaluating each of said reduced frame data sets against a succession of said cluster data sets to generate a cluster score S Y for each of said cluster data sets; E. selectively operable identifying means for identifying each of said word models of said cluster data sets having a cluster score bearing a predetermined relation to at least one threshold score T, said identified word models defining a candidate word list; F. control means for determining said frame start times t, where successive start times t are spaced apart arbitrarily, said frame start times being independent of identification of an initial anchor; and G. means for generating a signal representative of said candidate word list for preselected ones of said frame start times t determined by said control means.
Claim 5
Dependent Claim 50 words
A system according to claim 2 wherein said cluster data storage means and said frame data means are adapted whereby said succession of frame data sets is associated with duration D 1 , and wherein said cluster data sets are each associated with duration≦D 2 , such that: D.sub.1 ≧D.sub.2.
Claim 6
Dependent Claim 24 words
A system according to claim 2 wherein said cluster data storage means is adapted whereby said cluster data sets are wordstart cluster data sets.
Claim 7
Dependent Claim 41 words
A system according to claim 2 wherein said cluster data storage means is adapted whereby said word models of each of said cluster data sets correspond to acoustically similar utterances over a succession of no more than w frame data sets.
Claim 8
Dependent Claim 32 words
A system according to claim 2 wherein said data reduction means includes smooth frame means for processing said frame data sets whereby said reduced frame data sets are smoothed frame data sets.
Claim 9
Dependent Claim 94 words
A system according to claim 6 wherein said smooth frame means is adapted for determining smooth frame data sets in accordance with: ##EQU4## where Y 1 , Y 2 . . . Y s are said smooth frame data sets, and whereby each of said smooth frame data sets is associated with b of said frame data sets, and wherein said b are integers greater than 1, a i are predetermined weighting coefficients, and c defines an offset of each smooth frame data set with respect to the next previous smooth frame data set.
Claim 10
Dependent Claim 15 words
A system according to claim 7 wherein said data reduction means is adapted whereby w=b+(s-1)c.
Claim 11
Dependent Claim 15 words
A system according to claim 8 wherein said data reduction means is adapted whereby w=12.
Claim 12
Dependent Claim 15 words
A system according to claim 8 wherein said data reduction means is adapted whereby k=8.
Claim 13
Dependent Claim 15 words
A system according to claim 10 wherein said data reduction means is adapted whereby s=3.
Claim 14
Dependent Claim 15 words
A system according to claim 11 wherein said data reduction means is adapted whereby b=4.
Claim 15
Dependent Claim 15 words
A system according to claim 11 wherein said data reduction means is adapted whereby c=4.
Claim 16
Dependent Claim 16 words
A system according to claim 8 wherein w=12, k=8, s=3, b=4, c=4, and a i =1/b.
Claim 17
Dependent Claim 20 words
A system according to claim 7 wherein said data reduction means is adapted whereby said weighting coefficients a i =l/b.
Claim 18
Dependent Claim 80 words
A system according to claim 2 wherein said cluster data storage means is adapted whereby each of said word models includes r node data vectors f 1 , . . . , f r , where r≦s, each of said node data vectors being representative of a characteristic related to the occurrence of a selected one of acoustic segments from each word of a set of words associated with said cluster data sets in said acoustic segment of said utterances.
Claim 19
Dependent Claim 32 words
A system according to claim 16 wherein said cluster data storage means is adapted whereby said characteristic related to the occurrence of a selected one of acoustic segments comprises a probability distribution.
Claim 20
Dependent Claim 65 words
A system according to claim 17 wherein said cluster data storage means is adapted whereby said cluster score S Y corresponds to: ##EQU5## wherein Y i are ones of Y 1 , Y 2 , . . . , Y s , and r are said node data vectors f 1 , . . . , f r for corresponding ones of said word models.
Claim 21
Dependent Claim 15 words
A system according to claim 2 wherein said data reduction means is adapted whereby j=k.
Claim 22
Dependent Claim 47 words
A system according to claim 2 wherein indentifying means includes a first identifying means for identifying each of said cluster data sets having a cluster score measured with respect to a first predetermined threshold T 1 , said identified cluster data sets defining preliminary cluster data sets.
Claim 23
Dependent Claim 93 words
A system according to claim 20 further comprising means for generating a word score representative of the sum of said cluster score S Y of said cluster data set associated with each of said word models and a language model score S L and wherein said identifying means further comprises a selectively operable second identifying means for identifying each of said word models of each of said cluster data sets having a word score S Y measured with respect to a second threshold T 2 , said sum represented by: S.sub.W =S.sub.Y +S.sub.L.
Claim 24
Dependent Claim 310 words
A continuous speech processing method for processing speech including a succession of utterances comprising the steps of: A. storing a plurality of M cluster data sets, C 1 , . . . , C M , where M is an integer greater than 1, each of said cluster data sets including data representative of a plurality of word models; B. generating a succession of w frame data sets v t , v t +1, . . . v t +w-1, beginning at a frame start time t during said succession of utterances, where w is an integer greater than 1, each of said frame data sets being representative of successive acoustic segments of utterances for a frame period, each of said frame data sets including k values representative of different frame parameters where k≧1; C. reducing w of said frame data sets to generate s reduced frame data sets Y 1 , Y 2 , . . . , Y 3 , where s<w, each of said reduced frame data sets being related to an associated plurality of said frame data sets and including j related to the k values of said associated frame data sets, where j≦k; D. evaluating said reduced frame data sets with a succession of said cluster data sets to generate a cluster score S Y for each of said cluster data sets; E. identifying each of said word models having a cluster score bearing a predetermined relation to at least one threshold score T, said identified word models defining a word list; F. determining said frame start times, t, where successive start times t are identified at arbitrarily selected intervals, said frame start times being independent of identification of an initial anchor; and G. generating a signal representative of said candidate word list for selected ones of said frame start times determined in step F.
Claim 25
Dependent Claim 310 words
A continuous speech processing method for processing speech including a succession of utterances comprising the steps of: A. storing a plurality of M cluster data sets, C 1 , . . . , C M , where M is an integer greater than 1, each of said cluster data sets including data representative of a plurality of word models; B. generating a succession of w frame data sets v t , v t +1, . . . v t +w-1, beginning at a frame start time t during said succession of utterances, where w is an integer greater than 1, each of said frame data sets being representative of successive acoustic segments of utterances for a frame period, each of said frame data sets including k values representative of different frame parameters where k≧1; C. reducing w of said frame data sets to generate s reduced frame data sets Y 1 , Y 2 , . . . , Y 3 , where s<w, each of said reduced frame data sets being related to an associated plurality of said frame data sets and including j related to the k values of said associated frame data sets, where j≦k; D. evaluating said reduced frame data sets with a succession of said cluster data sets to generate a cluster score S Y for each of said cluster data sets; E. identifying each of said word models having a cluster score bearing a predetermined relation to at least one threshold score T, said identified word models defining a word list; F. determining said frame start times, t, where successive start times t are identified at arbitrarily selected intervals, said frame start times being independent of identification of an initial anchor; and G. generating a signal representative of said candidate word list for selected ones of said frame start times determined in step F.
Claim 26
Dependent Claim 21 words
A method according to claim 22 wherein said reducing step C further comprises the substep of smoothing said frame data sets.
Claim 27
Dependent Claim 69 words
A method according to claim 23 wherein said smoothing substep includes smoothing in accordance with ##EQU6## wherein Y 1 , Y 2 . . . Y s are said smooth frame data sets, and wherein said b are integers greater than 1, a i are predetermined weighting coefficients, and c defines an offset of each smooth frame data set with respect to the next previous smooth frame data set.
Claim 28
Dependent Claim 21 words
A method according to claim 24 wherein said smoothing substep includes setting w=12, k=8, s=3, b=4, c=4, and a i =1/b.
Claim 29
Dependent Claim 149 words
A method according to claim 22 wherein said storing step includes the substep of generating for each of said word models, r node data vectors f 1 , . . . , f r , where r is less than or equal to s, each of said node data vectors being representative of a characteristic related to the occurrence of a selected one of acoustic segments from each word of a set of words associated with said cluster data sets in said acoustic segment of said utterances, and wherein said evaluating step includes the substep of determining said cluster score S Y in accordance with: ##EQU7## wherein Y i are ones of Y 1 , Y 2 , . . . , Y s , and f i are said node data vectors f 1 , . . . , f r for corresponding ones of said word models.
Claim 30
Dependent Claim 112 words
A prefiltering method for processing continuous speech, said speech including a succession of utterances, comprising the steps of: A. storing a plurality of word models; B. identifying a succession of temporal segments of said utterances; C. operating on ones of said segments and selectively identifying a subset of said plurality of word models meeting predetermined criteria, said subset defining a list of candidate words; D. determining arbitrarily selected frame start times t during said utterances, said frame start times being independent of identification of an initial anchor; and E. generating a signal representative of said list of candidate words for selected ones of said frame start times t determined in step D.
Claim 31
Dependent Claim 112 words
A prefiltering method for processing continuous speech, said speech including a succession of utterances, comprising the steps of: A. storing a plurality of word models; B. identifying a succession of temporal segments of said utterances; C. operating on ones of said segments and selectively identifying a subset of said plurality of word models meeting predetermined criteria, said subset defining a list of candidate words; D. determining arbitrarily selected frame start times t during said utterances, said frame start times being independent of identification of an initial anchor; and E. generating a signal representative of said list of candidate words for selected ones of said frame start times t determined in step D.

References Cited (Backward Citations)

US4718094A Cited
US4783803A Cited
US4903305A Cited
US4829578A Cited
US4837831A Cited
US4829576A Cited
US4914703A Cited
US4803729A Cited
US4805219A Cited
US4805218A Cited

USPTO Annuity & Maintenance Windows

Annuity Stage Window Opens Payment Deadline Surcharge Period Until Estimated Fee Status
3.5 Years (Year 4) 1996-04-12 1996-10-12 1997-04-13 $2000.00 Window Closed / Lapsed
7.5 Years (Year 8) 2000-04-12 2000-10-12 2001-04-13 $3760.00 Window Closed / Lapsed
11.5 Years (Year 12) 2004-04-12 2004-10-12 2005-04-13 $7700.00 Window Closed / Lapsed

Assigned Categories & Tags

No categories assigned to this patent yet.

Assign Category Tag