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

Labelling speech using context-dependent acoustic prototypes

Assignee: International Business Machines Corp
•
Filing: 1993-02-08
•
Granted: 1995-10-03
•
Expires: 2013-02-08
📄 Original PDF 🌐 Google Patents 🔄 Sync Now

Abstract

Abstract The present invention relates to labelling of speech in a context-dependent speech recognition system. When labelling speech using context-dependent prototypes the phone context of a frame of speech needs to be aligned with the appropriate acoustic parameter vector. Since aligning a large amount of data is difficult if based upon arc ranks, the present invention aligns the data using context-independent acoustic prototypes. The phonetic context of each phone of the data is known. Therefore after the alignment step the acoustic parameter vectors are tagged with a corresponding phonetic context. Context-dependent prototype vectors exists for each label. For all labels the context-dependent prototype vectors having the same phonetic context as the tagged acoustic parameter vector are determined. For each label the probability of achieving the tagged acoustic parameter vector is determined given each of the context-dependent label prototype vectors having the same phonetic context as the tagged acoustic parameter vector. The label with the highest probability is associated with the context-dependent acoustic parameter vector.

Inventors

  • 👤 Lalit R. Bahl
  • 👤 Peter de Souza
  • 👤 P. S. Gopalakrishnan
  • 👤 Michael A. Picheny

Bibliographic Details

Application Number —
Jurisdiction US
Data Source google_patents
Last Synchronized 2026-10-31 20:41
CPC Classifications
G; G10; G10L; G10L15/00; G10L15/08; G10L15/14; G10L15/142; G10L15/02; G10L2015/025

Claims Analysis

Total Claims: 16
Claim 1
Independent Claim 332 words
A computer based speech recognition system for labeling speech using context-dependent label prototype vectors, the system having an input comprising a sequence of phones from a training text, each of said sequence of phones having an associated phonetic context the system comprising: a user interface configured to receive spoken sounds corresponding to a spoken version of the training text, and further configured to generate an outpt signal representative of said spoken sounds; a signal processor, coupled to said user interface, configured to convert said output signal into a series of feature vector signals; and a context-dependent labeller, coupled to said signal processor, configured to assign a context-dependent label to each feature vector signal of said series of feature vector signals to result in tagged feature vectors, comprising: aligning means, coupled to said signal processor, for aligning each of said feature vector signals with a corresponding phone to result in aligned feature vector signals, tagging means, coupled to said aligning means, for tagging each of said aligned feature vector signals with the phonetic context associated with said corresponding phone to result in tagged prototype vector signals, and first associating means, coupled to said tagging means, for associating a label with each of said tagged prototype vector signals based upon a context-dependent prototype vector signal, comprising: phonetic context identifying means for determining, for each said label, whether a context-dependent prototype vector signal exists corresponding to the phonetic context of the tagged prototype vector signal, matching score generating means, coupled to said phonetic context identifying means, for generating a score for achieving said tagged feature vector signal given each of said context-dependent prototype vector signals having the same phonetic context as the tagged feature vector signal as determined in said phonetic context identifying means, and associating means, coupled to said matching score generating means, for associating a label which is associated with a context-dependent prototype vector signal having the highest score as generated by said matching score generating means with said tagged feature vector signal.
Claim 2
Dependent Claim 332 words
A computer based speech recognition system for labeling speech using context-dependent label prototype vectors, the system having an input comprising a sequence of phones from a training text, each of said sequence of phones having an associated phonetic context the system comprising: a user interface configured to receive spoken sounds corresponding to a spoken version of the training text, and further configured to generate an outpt signal representative of said spoken sounds; a signal processor, coupled to said user interface, configured to convert said output signal into a series of feature vector signals; and a context-dependent labeller, coupled to said signal processor, configured to assign a context-dependent label to each feature vector signal of said series of feature vector signals to result in tagged feature vectors, comprising: aligning means, coupled to said signal processor, for aligning each of said feature vector signals with a corresponding phone to result in aligned feature vector signals, tagging means, coupled to said aligning means, for tagging each of said aligned feature vector signals with the phonetic context associated with said corresponding phone to result in tagged prototype vector signals, and first associating means, coupled to said tagging means, for associating a label with each of said tagged prototype vector signals based upon a context-dependent prototype vector signal, comprising: phonetic context identifying means for determining, for each said label, whether a context-dependent prototype vector signal exists corresponding to the phonetic context of the tagged prototype vector signal, matching score generating means, coupled to said phonetic context identifying means, for generating a score for achieving said tagged feature vector signal given each of said context-dependent prototype vector signals having the same phonetic context as the tagged feature vector signal as determined in said phonetic context identifying means, and associating means, coupled to said matching score generating means, for associating a label which is associated with a context-dependent prototype vector signal having the highest score as generated by said matching score generating means with said tagged feature vector signal.
Claim 3
Dependent Claim 24 words
The system of claim 1, further comprising: modeling means, coupled to said signal processing means, for modeling feature vector signals using Hidden Markov models.
Claim 4
Dependent Claim 13 words
The system of claim 1, wherein said aligning means comprises a Viterbi aligner.
Claim 5
Dependent Claim 26 words
The system of claim 1, further comprising: storing means, coupled to said association means, for storing said labels which are based upon said context-dependent prototype vectors.
Claim 6
Dependent Claim 40 words
The system of claim 1, further comprising: ranking means, coupled to said matching score generating means, for ranking one or more context-dependent label prototype vector signals based upon said context-dependent label's score as generated in said matching score generating means.
Claim 7
Dependent Claim 39 words
The system of claim 5, further comprising: storing means, coupled to said ranking means, for storing said context-dependent label prototype rank for said tagged feature vector signals having an input coupled to said ranking means and having an output.
Claim 8
Dependent Claim 51 words
The system of claim 1, further comprising: storing means, coupled to said matching score generator means, for storing said scores generated by said matching score generator means for each tagged feature vector signal given each of said context-dependent prototype vector signals having the same phonetic context as said tagged feature signal.
Claim 9
Independent Claim 317 words
A method for creating labels which are necessary for leafemic baseform construction, wherein a spoken version of a training text is converted into signals representing feature vectors in a signal processor, and wherein a sequence of phones are input from said training text each phone having a phonetic context associated with it, said phonetic context comprising one or more phones occurring immediately prior to or subsequent to said phone, context-independent prototype vectors and context-dependent prototype vectors having previously been stored in a memory module, comprising the steps of: (1) matching each of said feature vector signals with a most similar signal representing a context-independent label prototype vector said most similar signal determined by comparing one or more parameters of said feature vector signal with one or more parameters of each of said signals representing said context-independent label prototype vectors, which is stored in the memory module, to label each of said feature vector signals with said most similar signal representing a context-independent label; (2) aligning each of said context-independent labelled feature vector signals with a corresponding phone from said training text; (3) tagging each of said aligned feature vector signals with the phonetic context associated with said corresponding phone; (4) identifying signals representing one or more context-dependent label prototype vectors having the same phonetic context of a given tagged feature vector signal; (5) determining the score for achieving a feature vector signal given each of the context-dependent label prototype vector signals identified in step (4); (6) identifying a context-dependent label prototype vector signal which maximizes the score of said feature vector signal as determined in step (5); (7) replacing the context-independent label associated with said feature vector signal with a label associated with said maximum score context-dependent label prototype vector signal as identified in step (6) to label said feature vector signal with a context-dependent label; and (8) repeating steps (4)-(7) for each tagged feature vector signal.
Claim 10
Independent Claim 317 words
A method for creating labels which are necessary for leafemic baseform construction, wherein a spoken version of a training text is converted into signals representing feature vectors in a signal processor, and wherein a sequence of phones are input from said training text each phone having a phonetic context associated with it, said phonetic context comprising one or more phones occurring immediately prior to or subsequent to said phone, context-independent prototype vectors and context-dependent prototype vectors having previously been stored in a memory module, comprising the steps of: (1) matching each of said feature vector signals with a most similar signal representing a context-independent label prototype vector said most similar signal determined by comparing one or more parameters of said feature vector signal with one or more parameters of each of said signals representing said context-independent label prototype vectors, which is stored in the memory module, to label each of said feature vector signals with said most similar signal representing a context-independent label; (2) aligning each of said context-independent labelled feature vector signals with a corresponding phone from said training text; (3) tagging each of said aligned feature vector signals with the phonetic context associated with said corresponding phone; (4) identifying signals representing one or more context-dependent label prototype vectors having the same phonetic context of a given tagged feature vector signal; (5) determining the score for achieving a feature vector signal given each of the context-dependent label prototype vector signals identified in step (4); (6) identifying a context-dependent label prototype vector signal which maximizes the score of said feature vector signal as determined in step (5); (7) replacing the context-independent label associated with said feature vector signal with a label associated with said maximum score context-dependent label prototype vector signal as identified in step (6) to label said feature vector signal with a context-dependent label; and (8) repeating steps (4)-(7) for each tagged feature vector signal.
Claim 11
Dependent Claim 26 words
The method of claim 8, further comprising the step of (9) repeating steps (2)-(8) as necessary to achieve a desired level of convergence of said labels.
Claim 12
Dependent Claim 23 words
The method of claim 8 wherein said feature vector signals are received in the form of a series of acoustic parameter vector signals.
Claim 13
Dependent Claim 23 words
The method of claim 8 further comprising a step, immediately preceding step (1), of modelling said feature vector signals using Hidden Markov Models.
Claim 14
Dependent Claim 27 words
The method of claim 8 wherein step (2) includes, using the Viterbi Alignment technique to align said feature vector signals and said phones in a computer processor.
Claim 15
Dependent Claim 17 words
The method of claim 8 wherein step (5) includes, using Hidden Markov Models to determine said score.
Claim 16
Dependent Claim 36 words
The system of claim 8 further comprising a step, following step (5), of ranking said context-dependent label prototype vector signals according to the score determined in step (5) and storing said rank in the memory module.

References Cited (Backward Citations)

US5165007A Cited
US4819271A Cited
US4977599A Cited
US4820059A Cited
US4933973A Cited
US5168524A Cited
US5208897A Cited

USPTO Annuity & Maintenance Windows

Annuity Stage Window Opens Payment Deadline Surcharge Period Until Estimated Fee Status
3.5 Years (Year 4) 1998-10-02 1999-04-03 1999-10-03 $2000.00 Window Closed / Lapsed
7.5 Years (Year 8) 2002-10-02 2003-04-03 2003-10-03 $3760.00 Window Closed / Lapsed
11.5 Years (Year 12) 2006-10-02 2007-04-03 2007-10-03 $7700.00 Window Closed / Lapsed

Assigned Categories & Tags

No categories assigned to this patent yet.

Assign Category Tag