Reduction of Computation Time in Pattern Matching for Speech Recognition
|
10.5120/15823-4695 |
Munshi Yadav and Afshar Alam. Article: Reduction of Computation Time in Pattern Matching for Speech Recognition. International Journal of Computer Applications 90(18):35-37, March 2014. Full text available. BibTeX
@article{key:article,
author = {Munshi Yadav and Afshar Alam},
title = {Article: Reduction of Computation Time in Pattern Matching for Speech Recognition},
journal = {International Journal of Computer Applications},
year = {2014},
volume = {90},
number = {18},
pages = {35-37},
month = {March},
note = {Full text available}
}
Abstract
Speech recognition is playing a major role in today's daily life. Dynamic Time Warping (DTW) algorithm has been used in different application for the pattern matching, where the sample and stored reference data size is not equal due to time invariant or due to speed. DTW has been implemented and tested by various ways by different researchers for improving the efficiency of the algorithm. There are challenges of accuracy within reasonable time and cost of memory. Various algorithms are available for efficient computing in the sense of time and space. It has been found that generally accuracy and response time is not linear in nature. So there is tradeoff between accuracy and response time. This paper discuss a method which gives the improvement in response time as compared to exiting method in automatic speech recognition by machine in speaker dependent for isolated spoken word.
References
- Gregory N, Stainhaour and George Carayannis, "New Parallel Impementations for DTW Algorithms", IEEE Transactions on Acoustics , Speech, and Signal Processing. Vol. 38, No. 4, 1990, pp 705-711.
- Lawrence Rabiner,Biing-Hwang Juang and B. Yegnanarayana. "Fundamentals of Speech Recognition", Dorling Kindersley (India) Pvt. Ltd. 2009. Pp 135-136.
- Santosh K. Gaikward, Bharti W. Gawali and Pravin Yannawar. "A Review on Speech Recognition Techniwue", International Journal of Computer Applications (0975-8887) Volume 10-No. 3 November 2010, pp 16-24;
- Sakoe H. and Chiba, H. S. "Dynamic programming algorithm optimization for spoken word recognition". IEEE Trans. Acoust. Speech Signal Process , 1978, 26,(1), pp. 43-49.
- S. W. Jang, Y. J. Park and G. Y. Kim. "Branch and bound dynamic time warping", The Institution of Engineering and Technology, 2010, Vol. 46 No. 20.
- Thomas H. Cormen , Charkes E. Leiserson and Ronald L. Rivest, "Approximation Algorthm. Introduction to Algorithms Prentic Hall of India Private Limited 2001, ISBN81-203-1353-4 pp 1022-1023.
- Anany Levitin , "Introduction to The Design & Analysis of Algorithm" , Villanova University. Pearson Education (Singapur)Pvt. Ltd. 2003. Pp 376-377.
- Waibel Alexander, Krishanan N and Reddy Dabbala Rajagopal ,''Minimizing computational cost for dynamic programming algorithms(1981)" , Carnegie Mellon University, Computer Science Department, Paper 2436.
- S. W. Jang, Y. J. Park and G. Y. Kim , " Branch-and- Bound dynamic time warping ", The Institution of Engineering and Technology 2020,vol. 46, No. 20.
- Peckham. J. "Automatic Speech Recognition". New Electronics, pp 24-25
- H. T. Kumm and R. M. Lea Parallel "Computing Efficiency: Climbing the Learning Curve" IEEE pp 728-732
- Quarmby, D. , "Silicon Devices in Speech Recognition" in Bristow,G. (Ed):Electronic Speech Recognition (Collins London) pp 200-215 . 1986.
- B. A. Dautrich,L. R. Rabiner and T. B. Martin, "On The Use of Filter Bank features For Isolated Word Recognition", Proc. IEEE Conf. ASSP. pp. 1061-1064,1983.
- Denes. P. and Mathews. M. V. , "Spoken Digit Recognition Using Time Frequency Pattern Matching", J. Acoust. Soc. Am, Vol. 32,1960, pp1450-1455.