CFP last date
20 December 2024
Call for Paper
January Edition
IJCA solicits high quality original research papers for the upcoming January edition of the journal. The last date of research paper submission is 20 December 2024

Submit your paper
Know more
The week's pick
Responsive image
Improved Shuffled Frog Leaping Algorithm with Self-Adaptive Shuffling for Fuzzy Logic PD+G Controller Optimization in Robotic Manipulators

Duc Hoang Nguyen
Random Articles
Reseach Article

Reduction of Computation Time in Pattern Matching for Speech Recognition

by Munshi Yadav, Afshar Alam
journal cover thumbnail

International Journal of Computer Applications
Foundation of Computer Science (FCS), NY, USA
Volume 90 - Number 18
Year of Publication: 2014
Authors: Munshi Yadav, Afshar Alam
10.5120/15823-4695

Munshi Yadav, Afshar Alam . Reduction of Computation Time in Pattern Matching for Speech Recognition. International Journal of Computer Applications. 90, 18 ( March 2014), 35-37. DOI=10.5120/15823-4695

@article{ 10.5120/15823-4695,
author = { Munshi Yadav, Afshar Alam },
title = { Reduction of Computation Time in Pattern Matching for Speech Recognition },
journal = { International Journal of Computer Applications },
issue_date = { March 2014 },
volume = { 90 },
number = { 18 },
month = { March },
year = { 2014 },
issn = { 0975-8887 },
pages = { 35-37 },
numpages = {9},
url = { https://ijcaonline.org/archives/volume90/number18/15823-4695/ },
doi = { 10.5120/15823-4695 },
publisher = {Foundation of Computer Science (FCS), NY, USA},
address = {New York, USA}
}
%0 Journal Article
%1 2024-02-06T22:11:24.829284+05:30
%A Munshi Yadav
%A Afshar Alam
%T Reduction of Computation Time in Pattern Matching for Speech Recognition
%J International Journal of Computer Applications
%@ 0975-8887
%V 90
%N 18
%P 35-37
%D 2014
%I Foundation of Computer Science (FCS), NY, USA
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
  1. 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.
  2. Lawrence Rabiner,Biing-Hwang Juang and B. Yegnanarayana. "Fundamentals of Speech Recognition", Dorling Kindersley (India) Pvt. Ltd. 2009. Pp 135-136.
  3. 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;
  4. 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.
  5. 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.
  6. 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.
  7. Anany Levitin , "Introduction to The Design & Analysis of Algorithm" , Villanova University. Pearson Education (Singapur)Pvt. Ltd. 2003. Pp 376-377.
  8. Waibel Alexander, Krishanan N and Reddy Dabbala Rajagopal ,''Minimizing computational cost for dynamic programming algorithms(1981)" , Carnegie Mellon University, Computer Science Department, Paper 2436.
  9. 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.
  10. Peckham. J. "Automatic Speech Recognition". New Electronics, pp 24-25
  11. H. T. Kumm and R. M. Lea Parallel "Computing Efficiency: Climbing the Learning Curve" IEEE pp 728-732
  12. Quarmby, D. , "Silicon Devices in Speech Recognition" in Bristow,G. (Ed):Electronic Speech Recognition (Collins London) pp 200-215 . 1986.
  13. 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.
  14. Denes. P. and Mathews. M. V. , "Spoken Digit Recognition Using Time Frequency Pattern Matching", J. Acoust. Soc. Am, Vol. 32,1960, pp1450-1455.
Index Terms

Computer Science
Information Sciences

Keywords

DTW algorithm High Performance Computing.

Powered by PhDFocusTM