Abstract
The present paper studies the training aspect of the time-concentration neural network in the context of automatic speech recognition. The original model [Tank and Hopfield, 1987], uses constant connection weights to perform word-spotting from a input grapheme string. However, a more robust and automatic assignment of connection weights (i.e. training) is required for complex tasks such as speech recognition. A generalised training scheme based on probabilistic formulation has been proposed to enhance the performance of the network for a speech recognition experiment. Improvement of performance has been acheived using the proposed modification over the original formulation.
uunet!shakti!tifr!csc11
Preview
Unable to display preview. Download preview PDF.
References
Tank D.W. and Hopfield J.J., Neural Computation by concentrating information in time, Proc. of the National Academy of Sciences USA, vol. 84, pp. 1896–1900, April 1987.
Kohonen T. Self-organization and associative memory. pp. 16–20, Springer, Berlin, 1984.
Watrous RL. Speech Recognition using Connectionist Networks. PhD Thesis, University of Pennsylvania, 1988.
Waibel A, Hanazawa T, Hinton G, Shikano K, and Lang K. Phoneme Recognition using Time-Delay Neural Networks. Technical Report TR-1-0006, ATR Interpreting Telephony Research Laboratories, 1987.
Gold B and Lippmann RP. A Neural Network for Isolated-Word Recognition. Proceedings of International Conference of Acoustics, Speech and Signal Processing, pp. 44–47, 1988.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1990 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Krishnan, S., Poddar, P. (1990). A probabilistic training scheme for the time-concentration network. In: Ramani, S., Chandrasekar, R., Anjaneyulu, K.S.R. (eds) Knowledge Based Computer Systems. KBCS 1989. Lecture Notes in Computer Science, vol 444. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0018403
Download citation
DOI: https://doi.org/10.1007/BFb0018403
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-52850-0
Online ISBN: 978-3-540-47168-4
eBook Packages: Springer Book Archive