Skip to main content

Unsupervised Discovery of Recurring Spoken Terms Using Diagonal Patterns

  • Conference paper
  • First Online:
Pattern Recognition and Machine Intelligence (PReMI 2023)

Abstract

Spoken term discovery is a challenging task when a lot of spoken content is generated without annotation. The spoken term discovery task accomplished by pattern matching techniques resolves the challenge by directly capturing the resemblance of the spoken terms at the acoustic feature level. Despite feasibility, the pattern-matching approach generates more false alarms during the discovery task due to fluctuations that arise in natural speech; hence degradation in the performance was observed. In the proposed approach, the challenge that arises due to the variability is addressed in two stages. In the first stage, the RASTA-PLP spectrogram was used as an acoustic feature representation that reduces the variabilities among similar spoken contents. In the second stage, the novel Diagonal Pattern Search method unconstrainedly computes the pattern resemblance between the identical spoken terms at the segmental level. The proposed approach was evaluated using the IITKGP-SDUC speech corpus and inferred that a 10.11% improvement in the accuracy was achieved compared to other state-of-the-art systems in the spoken term discovery task.

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

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 89.00
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 119.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Notes

  1. 1.

    https://www.ee.columbia.edu/~dpwe/resources/matlab/rastamat/.

  2. 2.

    transliterated from Hindi to English for readability.

  3. 3.

    available at http://cse.iitkgp.ac.in/~ksrao/res.html.

References

  1. Park, A., Glass, J.R.: Towards unsupervised pattern discovery in speech. In: 2005 IEEE Workshop on Automatic Speech Recognition and Understanding, pp. 53–58 (2005)

    Google Scholar 

  2. Aimetti, G.: Modelling early language acquisition skills: towards a general statistical learning mechanism. In: Proceedings of the Student Research Workshop at EACL 2009, pp. 1–9 (2009)

    Google Scholar 

  3. Birla, L., et al.: A robust unsupervised pattern discovery and clustering of speech signals. Pattern Recogn. Lett. 116, 254–261 (2018)

    Article  Google Scholar 

  4. ten Bosch, L., Cranen, B.: A computational model for unsupervised word discovery. ISCA, Antwerp (2007)

    Google Scholar 

  5. Carterette, B., Voorhees, E.M.: Overview of information retrieval evaluation. In: Lupu, M., Mayer, K., Tait, J., Trippe, A. (eds.) Current Challenges in Patent Information Retrieval. The Information Retrieval Series, vol. 29, pp. 69–85. Springer, Heidelberg (2011). https://doi.org/10.1007/978-3-642-19231-9_3

    Chapter  Google Scholar 

  6. Catanese, L., et al.: MODIS: an audio motif discovery software. In: Show & Tell-Interspeech 2013 (2013)

    Google Scholar 

  7. Gupta, V., Ajmera, J., Kumar, A., Verma, A.: A language independent approach to audio search. In: Twelfth Annual Conference of the International Speech Communication Association (2011)

    Google Scholar 

  8. Hermansky, H., Morgan, N.: Rasta processing of speech. IEEE Trans. Speech Audio Process. 2(4), 578–589 (1994)

    Article  Google Scholar 

  9. Jansen, A., Van Durme, B.: Efficient spoken term discovery using randomized algorithms. In: 2011 IEEE Workshop on Automatic Speech Recognition & Understanding, pp. 401–406. IEEE (2011)

    Google Scholar 

  10. Kamper, H., Livescu, K., Goldwater, S.: An embedded segmental k-means model for unsupervised segmentation and clustering of speech. In: 2017 IEEE Automatic Speech Recognition and Understanding Workshop (ASRU), pp. 719–726 (2017)

    Google Scholar 

  11. Karthik, P.D., Saranya, M., Murthy, H.A.: A fast query-by-example spoken term detection for zero resource languages. In: 2016 International Conference on Signal Processing and Communications (SPCOM), pp. 1–5. IEEE (2016)

    Google Scholar 

  12. Park, A.S., Glass, J.R.: Unsupervised pattern discovery in speech. IEEE Trans. Audio Speech Lang. Process. 16(1), 186–197 (2008)

    Article  Google Scholar 

  13. Ram, D., Miculicich, L., Bourlard, H.: CNN based query by example spoken term detection. In: Interspeech, pp. 92–96 (2018)

    Google Scholar 

  14. Räsänen, O., Doyle, G., Frank, M.C.: Unsupervised word discovery from speech using automatic segmentation into syllable-like units. In: Sixteenth Annual Conference of the International Speech Communication Association (2015)

    Google Scholar 

  15. Ravi, K.K., Krothapalli, S.R.: Phoneme segmentation-based unsupervised pattern discovery and clustering of speech signals. Circ. Syst. Signal Process. 41(4), 2088–2117 (2022)

    Article  Google Scholar 

  16. San, N., et al.: Leveraging pre-trained representations to improve access to untranscribed speech from endangered languages. In: 2021 IEEE Automatic Speech Recognition and Understanding Workshop (ASRU), pp. 1094–1101. IEEE (2021)

    Google Scholar 

  17. Weintraub, M.: Keyword-spotting using SRI’s DECIPHER large-vocabulary speech-recognition system. In: 1993 IEEE International Conference on Acoustics, Speech, and Signal Processing, vol. 2, pp. 463–466. IEEE (1993)

    Google Scholar 

  18. Zhang, Y., Glass, J.R.: Towards multi-speaker unsupervised speech pattern discovery. In: 2010 IEEE International Conference on Acoustics, Speech and Signal Processing, pp. 4366–4369 (2010)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to P. Sudhakar .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2023 The Author(s), under exclusive license to Springer Nature Switzerland AG

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Sudhakar, P., Sreenivasa Rao, K., Mitra, P. (2023). Unsupervised Discovery of Recurring Spoken Terms Using Diagonal Patterns. In: Maji, P., Huang, T., Pal, N.R., Chaudhury, S., De, R.K. (eds) Pattern Recognition and Machine Intelligence. PReMI 2023. Lecture Notes in Computer Science, vol 14301. Springer, Cham. https://doi.org/10.1007/978-3-031-45170-6_7

Download citation

  • DOI: https://doi.org/10.1007/978-3-031-45170-6_7

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-031-45169-0

  • Online ISBN: 978-3-031-45170-6

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics