National Repository of Grey Literature 2 records found  Search took 0.00 seconds. 
Very limited Vocabulary Speech Recognizer
Vystavěl, Kamil ; Míča, Ivan (referee) ; Sysel, Petr (advisor)
This bachelor thesis deals with the implementation of voice diagnostic method with limited number of recognized words in Matlab environment. Recognizer is designed for recognition of isolated words and is based on the dynamic programming method. This method is realized by the dynamic time warping algorithm (DTW). Features of the speech signal are calculated by methods of short-term analysis in time and frequency domain and by methods that are based on cepstral analysis and linear predictive analysis. The representation of the word, which is generated from its features, is suitable for quantifying the degree of similarity with the representation of another word. In order to achieve the highest degree of similarity, the dynamic time warping algorithm eliminates influence of fluctuation of the speech rate by non-linear normalization time axis of one of the compared words. The degree of the similarity of the two compared words is enumerated as the words’ distance. The representations of known words are stored in a word-book. The unknown word is compared with all words in the word-book and recognizer calculates distances between every known word and the unknown word. The unknown word is defined as identical with the known word that has the shortest distance to the unknown word. The successfulness depends mainly on the choice of the features.
Very limited Vocabulary Speech Recognizer
Vystavěl, Kamil ; Míča, Ivan (referee) ; Sysel, Petr (advisor)
This bachelor thesis deals with the implementation of voice diagnostic method with limited number of recognized words in Matlab environment. Recognizer is designed for recognition of isolated words and is based on the dynamic programming method. This method is realized by the dynamic time warping algorithm (DTW). Features of the speech signal are calculated by methods of short-term analysis in time and frequency domain and by methods that are based on cepstral analysis and linear predictive analysis. The representation of the word, which is generated from its features, is suitable for quantifying the degree of similarity with the representation of another word. In order to achieve the highest degree of similarity, the dynamic time warping algorithm eliminates influence of fluctuation of the speech rate by non-linear normalization time axis of one of the compared words. The degree of the similarity of the two compared words is enumerated as the words’ distance. The representations of known words are stored in a word-book. The unknown word is compared with all words in the word-book and recognizer calculates distances between every known word and the unknown word. The unknown word is defined as identical with the known word that has the shortest distance to the unknown word. The successfulness depends mainly on the choice of the features.

Interested in being notified about new results for this query?
Subscribe to the RSS feed.