An Infinite-Connected Words Recognition System for Male Speakers Using Time-Space Dynamic Programming
Proceedings of the Sixth International Joint Conference on Artificial Intelligence. .
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-~isely two kinds of normalizations : the time normalization for removing speed variat1on of speech and the space normalization for removing speaker-dependence. This algo:ithm is realizable by a simple cellular automaton. The recognition rate 85.7% is obta1ned for 50 categories, h male speakers and 1140 samples (connected words).
@inproceedings{ijcai1979p150,
title = {An Infinite-Connected Words Recognition System for Male Speakers Using Time-Space Dynamic Programming},
author = {Oka, Ryuichi},
booktitle = {Proceedings of the Sixth International Joint Conference on
Artificial Intelligence, {IJCAI-79}},
publisher = {International Joint Conferences on Artificial Intelligence},
editor = {Bruce G. Buchanan},
year = {1979},
month = {8},
url = {https://ijcai.org/proceedings/1979/150},
}
TY - CPAPER TI - An Infinite-Connected Words Recognition System for Male Speakers Using Time-Space Dynamic Programming AU - Oka, Ryuichi T2 - Proceedings of the Sixth International Joint Conference on Artificial Intelligence, IJCAI-79 PB - International Joint Conferences on Artificial Intelligence PY - 1979 UR - https://ijcai.org/proceedings/1979/150 ER -Copied
Machine-readable versions of this paper, for tools and AI agents:
