Automatic speaker independent alignment of continuous speech with its phonetic transcription using a hidden Markov model
| dc.contributor.author | Bruemmer J.N.L. | |
| dc.contributor.author | Coetzer M.W. | |
| dc.date.accessioned | 2011-05-15T16:05:57Z | |
| dc.date.available | 2011-05-15T16:05:57Z | |
| dc.date.issued | 1988 | |
| dc.description.abstract | A way is presented to time-align phonetic transcriptions with an acoustic speech waveform using hidden Markov models defined by the transcriptions. Given an utterance of speech and its phonetic transcription, the algorithm will yield the starting and ending times of all the phonemes in the transcription, relative to the start of the utterance. The probabilities for the model are obtained from phoneme duration probabilities and feature probabilities for a few coarse phoneme classes. Because of the coarse classes, the method is speaker-independent. The alignment is accomplished using the Viterbi algorithm. An efficient way of implementing the Viterbi algorithm is given. By using single word transcriptions, the method can be used to detect words in continuous speech, which allows words to be searched for using only their phonetic representations. Two different hidden Markov models (HMM) were used, one with discrete observation symbols and one with continuous observation vectors. The continuous model works better, but the discrete one works faster. | |
| dc.description.version | Conference Paper | |
| dc.identifier.citation | [No source information available] | |
| dc.identifier.uri | http://hdl.handle.net/10019.1/13210 | |
| dc.publisher | Publ by IEEE, Piscataway, NJ, United States | |
| dc.subject | Computer Programming--Algorithms | |
| dc.subject | Probability | |
| dc.subject | Acoustic Speech Waveforms | |
| dc.subject | Hidden Markov Model | |
| dc.subject | Speech | |
| dc.title | Automatic speaker independent alignment of continuous speech with its phonetic transcription using a hidden Markov model | |
| dc.type | Conference Paper |