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.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsReferences
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
Bouselmi G, Fohr D et al (2005) Fully automated non-native speech recognition using confusion-based acoustic model integration
Brin S (1995) Near neighbor search in large metric spaces. In: 21th international conference on very large data, Morgan Kaufmann Publishers Inc, San Francisco
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
Demuynck K, Duchateau J et al (2000) An efficient search space representation for large vocabulary continuous speech recognition. Speech Commun 30(1):37–53
Dharanipragada S, Roukos S (2002) A multistage algorithm for spotting new words in speech. IEEE Trans Speech Audio Process 10(8):542–550
Doddington GR (1989) Phonetically sensitive discriminants for improved speech recognition. In: International conference on acoustics, speech, and signal processing (ICASSP’89), IEEE, Glasgow
Guo L, Matta M (1999) Search space reduction in QoS routing. In: 19th international conference on distributed computing systems
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
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
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
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
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
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
Ney H, Mergel D et al (1992) Data driven search organization for continuous speech recognition. IEEE Trans Signal Process 40(2):272–281
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
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
Saraclar M, Sproat R (2004) Lattice-based search for spoken utterance retrieval. In: HLT-NAACL (2004), Boston
Schwartz R, Austin S (1991) A comparison of several approximate algorithms for finding multiple (N-best) sentence hypotheses. IEEE
Schwartz R, Chow YL (1990) The N-best algorithms: an efficient and exact procedure for finding the N most likely sentence hypotheses. IEEE
Schwartz R, Austin S et al (1992) New uses for the N-best sentence hypotheses within the BYBLOS speech recognition system. IEEE
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
Srinivas M, Patnaik L (1991) Learning neural network weights using genetic algorithms-improving performance by search-space reduction. IEEE
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
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
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
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
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
Young SJ (1993) The HTK hidden Markov model toolkit: design and philosophy. Technical Report TR 153, Department of Engineering, Cambridge University, Cambridge
Young S (1996) A review of large-vocabulary continuous speech recognition. Signal Process Mag IEEE 13(5):45
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
Young SR, Hauptmann AG et al (1989b) High level knowledge sources in usable speech recognition systems. Commun ACM 32(2):183–194
Ž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
Author information
Authors and Affiliations
Rights 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)