An Infinite-Connected Words Recognition System for Male Speakers Using Time-Space Dynamic Programming
Abstract
A new algorithm of pattern matching for time-space speech feature using Dynamic Programming is proposed for recognizing infinite-connected words spoken by male speakers without adaptation of speakers before the utterance. The new algorithm carries out frame-wisely two kinds of normalizations : the time normalization for removing speed variation of speech and the space normalization for removing speaker-dependence. This algorithm is realizable by a simple cellular automaton. The recognition rate 85.7% is obtained for 50 categories, h male speakers and 440 samples (connected words).
Cite
Text
Oka. "An Infinite-Connected Words Recognition System for Male Speakers Using Time-Space Dynamic Programming." International Joint Conference on Artificial Intelligence, 1979.Markdown
[Oka. "An Infinite-Connected Words Recognition System for Male Speakers Using Time-Space Dynamic Programming." International Joint Conference on Artificial Intelligence, 1979.](https://mlanthology.org/ijcai/1979/oka1979ijcai-infinite/)BibTeX
@inproceedings{oka1979ijcai-infinite,
title = {{An Infinite-Connected Words Recognition System for Male Speakers Using Time-Space Dynamic Programming}},
author = {Oka, Ryu-ichi},
booktitle = {International Joint Conference on Artificial Intelligence},
year = {1979},
pages = {687-689},
url = {https://mlanthology.org/ijcai/1979/oka1979ijcai-infinite/}
}