메뉴 건너뛰기




Volumn 51, Issue 9, 2009, Pages 732-743

Efficient codebooks for fast and accurate low resource ASR systems

Author keywords

Codebook; Gaussian selection; Speech recognition

Indexed keywords

AUTOMATIC SPEECH RECOGNITION; CODEBOOK; CODEBOOKS; CONTINUOUS HIDDEN MARKOV MODEL; GAUSSIAN SELECTION; LARGE VOCABULARY CONTINUOUS SPEECH RECOGNITION; LIKELIHOOD COMPUTATION; MULTI-LEVEL; RECOGNITION SPEED; RESOURCE CONSUMPTION; SPEECH INTERFACE; TIME-CONSUMING PARTS;

EID: 67649134955     PISSN: 01676393     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.specom.2009.01.010     Document Type: Article
Times cited : (3)

References (32)
  • 2
    • 0027297381 scopus 로고
    • Vector quantization for the efficient computation of continuous density likelihoods
    • Bocchieri E. Vector quantization for the efficient computation of continuous density likelihoods. Internat. Conf. Acoust. Speech Signal Process. (1993) 692-695
    • (1993) Internat. Conf. Acoust. Speech Signal Process. , pp. 692-695
    • Bocchieri, E.1
  • 3
    • 85009112348 scopus 로고    scopus 로고
    • Four layer categorization scheme of fast GMM computation techniques in large vocabulary continuous speech recognition systems
    • Jesu Island, Korea
    • Chan, A., Sherwani, J., Mosur, R., Rudnicky, A., 2004. Four layer categorization scheme of fast GMM computation techniques in large vocabulary continuous speech recognition systems. In: Internat. Conf. on Spoken Language Processing, Jesu Island, Korea.
    • (2004) Internat. Conf. on Spoken Language Processing
    • Chan, A.1    Sherwani, J.2    Mosur, R.3    Rudnicky, A.4
  • 5
    • 0030193422 scopus 로고    scopus 로고
    • Genones: generalized mixture tying in continuous Hidden Markov model-based speech recognizers
    • Digalakis V., Monaco P., and Murveit H. Genones: generalized mixture tying in continuous Hidden Markov model-based speech recognizers. IEEE Trans. Speech Audio Process. 4 (1996) 281-289
    • (1996) IEEE Trans. Speech Audio Process. , vol.4 , pp. 281-289
    • Digalakis, V.1    Monaco, P.2    Murveit, H.3
  • 6
    • 0033899916 scopus 로고    scopus 로고
    • Efficient speech recognition using subvector quantization and discrete-mixture HMMs
    • Digalakis V., Tsakalidis S., Harizakis c., and Neumeyer L. Efficient speech recognition using subvector quantization and discrete-mixture HMMs. Comput. Speech Lang. (2000) 33-46
    • (2000) Comput. Speech Lang. , pp. 33-46
    • Digalakis, V.1    Tsakalidis, S.2    Harizakis, c.3    Neumeyer, L.4
  • 8
    • 0030371769 scopus 로고    scopus 로고
    • Use of Gaussian selection in large vocabulary continuous speech recognition using HMMs
    • Gales, M.J.F., McKnill, K., Young, S., 1996. Use of Gaussian selection in large vocabulary continuous speech recognition using HMMs. In: Internat. Conf. on Spoken Language Processing, pp. 470-473.
    • (1996) Internat. Conf. on Spoken Language Processing , pp. 470-473
    • Gales, M.J.F.1    McKnill, K.2    Young, S.3
  • 9
    • 0030371769 scopus 로고    scopus 로고
    • State based Gaussian selection in large vocabulary continuous speech recognition using HMMs
    • Gales M.J.F., McKnill K., and Young S. State based Gaussian selection in large vocabulary continuous speech recognition using HMMs. IEEE Trans. Speech Audio Process. (1999) 470-473
    • (1999) IEEE Trans. Speech Audio Process. , pp. 470-473
    • Gales, M.J.F.1    McKnill, K.2    Young, S.3
  • 12
    • 0029725761 scopus 로고    scopus 로고
    • The bucket box intersection (BBI) algorithm for fast approximative evaluation of diagonal mixture Gaussians
    • Jurgen F., and Ivica R. The bucket box intersection (BBI) algorithm for fast approximative evaluation of diagonal mixture Gaussians. Internat. Conf. Acoust. Speech Signal Process. (1996) 837-840
    • (1996) Internat. Conf. Acoust. Speech Signal Process. , pp. 837-840
    • Jurgen, F.1    Ivica, R.2
  • 13
    • 67649094787 scopus 로고    scopus 로고
    • Speeding up the score computation of HMM speech recognizers with the Bucket Voronoi intersection algorithm
    • Jurgen, F., Ivica, R., Tile, S., 1996. Speeding up the score computation of HMM speech recognizers with the Bucket Voronoi intersection algorithm. In: Eur. Conf. on Speech Communication and Technology, pp. 1091-1094.
    • (1996) Eur. Conf. on Speech Communication and Technology , pp. 1091-1094
    • Jurgen, F.1    Ivica, R.2    Tile, S.3
  • 18
  • 19
    • 0035340712 scopus 로고    scopus 로고
    • Online adaptation of HMMs to real life conditions: a unified framework
    • Mokbel C. Online adaptation of HMMs to real life conditions: a unified framework. IEEE Trans. Speech Audio Process. (2001) 342-357
    • (2001) IEEE Trans. Speech Audio Process. , pp. 342-357
    • Mokbel, C.1
  • 20
    • 67649122716 scopus 로고    scopus 로고
    • Sub-vector clustering to improve memory and speed performance of acoustic likelihood computation
    • Rhodes, Greece
    • Mosur, R.M., Bisiani, R., Thayer, E., 1997. Sub-vector clustering to improve memory and speed performance of acoustic likelihood computation. In: Eur. Conf. on Speech Communication and Technology, Rhodes, Greece.
    • (1997) Eur. Conf. on Speech Communication and Technology
    • Mosur, R.M.1    Bisiani, R.2    Thayer, E.3
  • 21
    • 67649122486 scopus 로고    scopus 로고
    • Gaussian selection using multiple quantisation indexes
    • Olsen, J., 2000. Gaussian selection using multiple quantisation indexes. In: IEEE Nordic Processing Symposium.
    • (2000) IEEE Nordic Processing Symposium
    • Olsen, J.1
  • 22
    • 85135169713 scopus 로고    scopus 로고
    • Fast likelihood computation methods for continuous mixture densities in large vocabulary speech recognition
    • Rhodes, Greece, pp
    • Ortmanns, S., Ney, H., Firslaff, T., 1997. Fast likelihood computation methods for continuous mixture densities in large vocabulary speech recognition. In: Eur. Conf. on Speech Communication and Technology, Rhodes, Greece, pp. 139-142.
    • (1997) Eur. Conf. on Speech Communication and Technology , pp. 139-142
    • Ortmanns, S.1    Ney, H.2    Firslaff, T.3
  • 25
    • 0035424821 scopus 로고    scopus 로고
    • Fast likelihood computation techniques for nearest-neighbor based search for continuous speech recognition
    • Pellom B., Sarikaya R., and Hansen J.H.L. Fast likelihood computation techniques for nearest-neighbor based search for continuous speech recognition. IEEE Signal Process. Lett. 8 8 (2001) 221-224
    • (2001) IEEE Signal Process. Lett. , vol.8 , Issue.8 , pp. 221-224
    • Pellom, B.1    Sarikaya, R.2    Hansen, J.H.L.3
  • 27
    • 84857881452 scopus 로고    scopus 로고
    • Parameter tying and Gaussian clustering for faster, better, and smaller speech recognition
    • Communication and Technology, Greece
    • Sankar, A., Ramana, V., 1999. Parameter tying and Gaussian clustering for faster, better, and smaller speech recognition. In: Eur. Conf. on Speech, Communication and Technology, Greece.
    • (1999) Eur. Conf. on Speech
    • Sankar, A.1    Ramana, V.2
  • 28
    • 0036567791 scopus 로고    scopus 로고
    • Improved modeling and efficiency for automatic transcription of broadcast news
    • Sankar A., Ramana V., Stolcke A., and Weng F. Improved modeling and efficiency for automatic transcription of broadcast news. Speech Comm. 37 (2002) 133-158
    • (2002) Speech Comm. , vol.37 , pp. 133-158
    • Sankar, A.1    Ramana, V.2    Stolcke, A.3    Weng, F.4
  • 30


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.