A Recognition Method of Connected Spoken Words With Syntactical Constraints by Augmented Continuous DP Algorithm
Proceedings of the Eighth International Joint Conference on Artificial Intelligence. Natural Language. Pages 639-641.
Abstract
The technique of dy namic time warping by using dynamic programming is powerful for isolated word recognition. An augmented continuous dynamic programming algorithm is proposed for connected spoken word recognition with syntactical constraints, The algorithm is based on the same principle of two level DP and level building DP. Although our algorithm obtains a near optimal solution for the recognition principle based on pattern matching, it is computationaly more efficient than the conventional methods and also does not require many memory storages. Therefore it is useful for connected word recognition with syntactical constraints in a large vocabulary. The amount of computation is almost the same as that for isolated word recognition .
@inproceedings{ijcai1983p152,
title = {A Recognition Method of Connected Spoken Words With Syntactical Constraints by Augmented Continuous DP Algorithm},
author = {Nakagawa, Sei-ichi},
booktitle = {Proceedings of the Eighth International Joint Conference on
Artificial Intelligence, {IJCAI-83}},
publisher = {International Joint Conferences on Artificial Intelligence},
editor = {Alan Bundy},
pages = {639--641},
year = {1983},
note = {Natural Language},
url = {https://ijcai.org/proceedings/1983/152},
}
TY - CPAPER TI - A Recognition Method of Connected Spoken Words With Syntactical Constraints by Augmented Continuous DP Algorithm AU - Nakagawa, Sei-ichi T2 - Proceedings of the Eighth International Joint Conference on Artificial Intelligence, IJCAI-83 PB - International Joint Conferences on Artificial Intelligence PY - 1983 SP - 639 EP - 641 UR - https://ijcai.org/proceedings/1983/152 ER -Copied
Machine-readable versions of this paper, for tools and AI agents:
