Nothing Special   »   [go: up one dir, main page]

Skip to main content

An Utterance Verification Algorithm in Keyword Spotting System

  • Conference paper
Pattern Recognition and Image Analysis (IbPRIA 2005)

Part of the book series: Lecture Notes in Computer Science ((LNIP,volume 3523))

Included in the following conference series:

  • 1664 Accesses

Abstract

Speech Recognition and Verification are important components of a Keyword Spotting System whose performance is determined by both of them. In this paper, a new model-distance based utterance verification algorithm is proposed to improve the performance of the keyword spotting system. Furthermore, a substitution-error recovery module is built for improving of the system, which enhances the detection rate with the false-alarm rate remaining almost the same. Experiment shows that with the novel utterance verification method and new added substitution-error recovery module, the system performance is improved greatly.

This paper is supported by Natural Science Foundation No.60272019 and No. 60321002.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Similar content being viewed by others

References

  1. Christiansen, R.W., Rushforth, C.K.: Detecting and Locating Key Words in Continuous Speech Using Linear Predictive Coding. TEEE Trans. On ASSP ASSP-25(5), 361–367 (1977)

    Article  Google Scholar 

  2. Higgins, A.L., Wohlford, R.E.: Keyword Recognition Using Template Concatenation. In: ICASSP 1985, vol. 3, pp. 1233–1236 (1985)

    Google Scholar 

  3. Wilpon, J.G., Lee, C.H., Rabiner, L.R.: Application of Hidden Markov Models for Recognition of a Limited Set of Words in Unconstrained Speech. In: ICASSP 1989, vol. 3, pp. 254–257 (1989)

    Google Scholar 

  4. Rohlicek, J.R., Russel, W., Roukos, S., Gish, H.: Continuous Hidden Markov Modeling for Speaker-Independent Word Spotting. In: ICASSP 1989, vol. 3, pp. 627–630 (1989)

    Google Scholar 

  5. Tadj, C., Poirier, F.: Keyword Spotting Using Supervised/Unsupervised Competitive Learning. In: Tadj, C., Poirier, F. (eds.) ICASSP 1995, vol. 1, pp. 301–304 (1995)

    Google Scholar 

  6. Lleida, E., Rose, R.C.: Utterance Verification in Continuous Speech Recognition: Decoding and Training Procedures. IEEE Trans. on Speech and Audio Processing 8(2), 126–139 (2000)

    Article  Google Scholar 

  7. Molau, S., Keysers, D., Ney, H.: Matching training and test data distributions for robust speech recognition. Speech Communication (2003)

    Google Scholar 

  8. Yan, B., Guo, R., Zhu, X.: Continuous Speech Recognition and Verification based on a Combination Score. In: EUROSPEECH 2003, Geneva (2003)

    Google Scholar 

  9. Haisheng, D., Xiaoyan, Z., Yupin, L., Shiyuan, Y.: A Novel Keyword Verification Algorithm. Accepted by ACTA Electronica Sinica

    Google Scholar 

  10. SchWartz, R.: Efficient, High-Performance Algorithms for N-Best Search. In: DARPA Speech and Natural Language Workshop, pp. 6–11 (1990)

    Google Scholar 

  11. Wu, C.-H., Chen, Y.-J.: Recovery from false rejection using statistical partial pattern trees for sentence verification. Speech Communication (2003)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2005 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Dai, H., Zhu, X., Luo, Y., Yang, S. (2005). An Utterance Verification Algorithm in Keyword Spotting System. In: Marques, J.S., Pérez de la Blanca, N., Pina, P. (eds) Pattern Recognition and Image Analysis. IbPRIA 2005. Lecture Notes in Computer Science, vol 3523. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11492542_68

Download citation

  • DOI: https://doi.org/10.1007/11492542_68

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-26154-4

  • Online ISBN: 978-3-540-32238-2

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics