Skip to main content
SpringerLink
Log in
Book cover

Phonetic Search Methods for Large Speech Databases pp 19–27Cite as

Search Space Complexity Reduction

  • Chapter
  • First Online:

  • 774 Accesses

Part of the book series: SpringerBriefs in Electrical and Computer Engineering ((BRIEFSSPEECHTECH))

Abstract

Various studies have focused on exploring ways to search more efficiently; this chapter will present an overview of methods that deal with efficient searching, with a focus on methods that reduce the size of the search space. The basis of all these methods is to formulate and use constraints that trim down the search space by eliminating impossible paths, dimensions or locations, thus leaving a reduced grid on which to perform the search.

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

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   39.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   54.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

Learn about institutional subscriptions

References

  • Bingham E, Mannila H (2001) Random projection in dimensionality reduction: applications to image and text data. In: The seventh ACM SIGKDD international conference on knowledge discovery and data mining, ACM, San Francisco

    Google Scholar 

  • Bouselmi G, Fohr D et al (2005) Fully automated non-native speech recognition using confusion-based acoustic model integration

    Google Scholar 

  • Brin S (1995) Near neighbor search in large metric spaces. In: 21th international conference on very large data, Morgan Kaufmann Publishers Inc, San Francisco

    Google Scholar 

  • Burget L, Černocký J et al (2006) Indexing and search methods for spoken document. In: Text, speech and dialogue 4188/2006 of Lecture notes in computer science. pp 351–358

    Google Scholar 

  • Demuynck K, Duchateau J et al (2000) An efficient search space representation for large vocabulary continuous speech recognition. Speech Commun 30(1):37–53

    Article  Google Scholar 

  • Dharanipragada S, Roukos S (2002) A multistage algorithm for spotting new words in speech. IEEE Trans Speech Audio Process 10(8):542–550

    Article  Google Scholar 

  • Doddington GR (1989) Phonetically sensitive discriminants for improved speech recognition. In: International conference on acoustics, speech, and signal processing (ICASSP’89), IEEE, Glasgow

    Google Scholar 

  • Guo L, Matta M (1999) Search space reduction in QoS routing. In: 19th international conference on distributed computing systems

    Google Scholar 

  • Haeb-Umbach R, Ney H (1994) Improvements in beam search for 10000-word continuous-speech recognition. IEEE Trans Speech Audio Process 2(2):353–356

    Article  Google Scholar 

  • James DA, Young SJ (1994) A fast lattice-based approach to vocabulary independent wordspotting. In: International conference on acoustics, speech, and signal processing (ICASSP’94), IEEE CS, Adelaide

    Google Scholar 

  • Jurafsky MJH (2000) Minimum edit distance. Speech and language processing: an introduction to natural language processing, computational linguistics, and speech recognition. Prentice Hall, Upper Saddle River

    Google Scholar 

  • Kuri-Morales A, Rodríguez-Erazo F (2009) A search space reduction methodology for data mining in large databases. Eng Appl Artif Intel 22(1):57–65

    Article  Google Scholar 

  • Moallem P, Faez K (2001) Search space reduction in the edge based stereo correspondence. In: 6th international fall workshop on vision, modeling, and visualization, Citeseer

    Google Scholar 

  • Murveit H, Butzberger J et al (1993) Large-vocabulary dictation using SRI’s DECIPHER speech recognition system: progressive search techniques. In: IEEE international conference on acoustics, speech, and signal processing (ICASSP’93), IEEE, Minneapolis

    Google Scholar 

  • Ney H, Mergel D et al (1992) Data driven search organization for continuous speech recognition. IEEE Trans Signal Process 40(2):272–281

    Article  Google Scholar 

  • Ramasubramanian V, Paliwal KK (1992) An efficient approximation-elimination algorithm for fast nearest-neighbor search based on a spherical distance coordinate formulation. Pattern Recognit Lett 13(7):471–480

    Article  Google Scholar 

  • Richardson F, Ostendorf M et al (1995) Lattice-based search strategies for large vocabulary speech recognition. In: International conference on acoustics, speech, and signal processing (ICASSP’95), IEEE

    Google Scholar 

  • Saraclar M, Sproat R (2004) Lattice-based search for spoken utterance retrieval. In: HLT-NAACL (2004), Boston

    Google Scholar 

  • Schwartz R, Austin S (1991) A comparison of several approximate algorithms for finding multiple (N-best) sentence hypotheses. IEEE

    Google Scholar 

  • Schwartz R, Chow YL (1990) The N-best algorithms: an efficient and exact procedure for finding the N most likely sentence hypotheses. IEEE

    Google Scholar 

  • Schwartz R, Austin S et al (1992) New uses for the N-best sentence hypotheses within the BYBLOS speech recognition system. IEEE

    Google Scholar 

  • Seide F, Yu P et al (2004) Vocabulary-independent search in spontaneous speech. In: IEEE international conference on acoustics, speech, and signal processing (ICASSP’04), Montreal

    Google Scholar 

  • Srinivas M, Patnaik L (1991) Learning neural network weights using genetic algorithms-improving performance by search-space reduction. IEEE

    Google Scholar 

  • Tetariy E, Aharonson V et al (2010) Phonetic search using an anchor-based algorithm. In: Proceedings of IEEE 26th convention of electrical and electronics engineering in Israel, Eilat

    Google Scholar 

  • Tetariy E, Gishri M, Har-Lev B, Aharonson V, Moyal A (2012) An efficient lattice-based phonetic search method for accelerating keyword spotting in large speech databases. Int J Speech Technol (2012):1–9

    Google Scholar 

  • Thambiratnam K (2005) Acoustic keyword spotting in speech with applications to data mining. PhD, Speech and Audio Research Laboratory of the SAIVT Program—Center for Built Environment and Engineering Research. Queensland University of Technology, Brisbane, p 248

    Google Scholar 

  • Thambiratnam K, Sridharan S (2007) Rapid yet accurate speech indexing using dynamic match lattice spotting. IEEE Trans Audio Speech Lang Process 15(1):346–357

    Article  Google Scholar 

  • Witbrock MJ, Hauptmann AG (1997) Using words and phonetic strings for efficient information retrieval from imperfectly transcribed spoken documents. In: The second ACM international conference on digital libraries, ACM

    Google Scholar 

  • Young SJ (1993) The HTK hidden Markov model toolkit: design and philosophy. Technical Report TR 153, Department of Engineering, Cambridge University, Cambridge

    Google Scholar 

  • Young S (1996) A review of large-vocabulary continuous speech recognition. Signal Process Mag IEEE 13(5):45

    Article  Google Scholar 

  • Young SJ, Russell N et al (1989) Token passing: a simple conceptual model for connected speech recognition systems. Engineering Department, Cambridge University, pp 1–23

    Google Scholar 

  • Young SR, Hauptmann AG et al (1989b) High level knowledge sources in usable speech recognition systems. Commun ACM 32(2):183–194

    Article  Google Scholar 

  • Žgank A, Horvat B et al (2005) Data-driven generation of phonetic broad classes, based on phoneme confusion matrix similarity. Speech Commun 47(3):379–393

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Afeka Academic College of Engineering, Tel-Aviv, Israel

    Ami Moyal, Vered Aharonson, Ella Tetariy & Michal Gishri

Authors
  1. Ami Moyal
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Vered Aharonson
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Ella Tetariy
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Michal Gishri
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

Copyright information

© 2013 The Author(s)

About this chapter

Cite this chapter

Moyal, A., Aharonson, V., Tetariy, E., Gishri, M. (2013). Search Space Complexity Reduction. In: Phonetic Search Methods for Large Speech Databases. SpringerBriefs in Electrical and Computer Engineering(). Springer, New York, NY. https://doi.org/10.1007/978-1-4614-6489-1_4

Download citation

  • DOI: https://doi.org/10.1007/978-1-4614-6489-1_4

  • Published:

  • Publisher Name: Springer, New York, NY

  • Print ISBN: 978-1-4614-6488-4

  • Online ISBN: 978-1-4614-6489-1

  • eBook Packages: EngineeringEngineering (R0)

Publish with us

Policies and ethics

Search

Navigation