메뉴 건너뛰기




Volumn , Issue , 1995, Pages 1083-1086

HAMMING DISTANCE APPROXIMATION FOR A FAST LOG-LIKELIHOOD COMPUTATION FOR MIXTURE DENSITIES

Author keywords

[No Author keywords available]

Indexed keywords

DECODING; HAMMING DISTANCE; MIXTURES; SPEECH COMMUNICATION; SPEECH RECOGNITION; VOCABULARY CONTROL;

EID: 0000972383     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper
Times cited : (15)

References (10)
  • 1
    • 0346316365 scopus 로고
    • Fast Log-Likelihood Computation for Mixture Densities in a High-Dimensional Feature Space
    • p. Beyerlein, "Fast Log-Likelihood Computation for Mixture Densities in a High-Dimensional Feature Space", Proc. I C S L P Yokohama, 1994, pp. 271-274.
    • (1994) Proc. I C S L P Yokohama , pp. 271-274
    • Beyerlein, p.1
  • 2
    • 0003157702 scopus 로고
    • Acoustic Modelling of Phoneme Units for Continuous Speech Recognition
    • H. Ney, "Acoustic Modelling of Phoneme Units for Continuous Speech Recognition", Signal Processing V: Theory and Applications, 1990.
    • (1990) Signal Processing V: Theory and Applications
    • Ney, H.1
  • 4
    • 0022858293 scopus 로고
    • An Algorithm For Finding Nearest Neighbors in (Approximately) Constant Average Time
    • E. Vidal, "An Algorithm For Finding Nearest Neighbors in (Approximately) Constant Average Time", Pattern Recognition Letters 4, 1986.
    • (1986) Pattern Recognition Letters , vol.4
    • Vidal, E.1
  • 6
    • 0027297381 scopus 로고
    • Vector Quantization for the Efficient Computation of Continuous Density Likelihoods
    • E. Bocchieri. "Vector Quantization for the Efficient Computation of Continuous Density Likelihoods", Proc. ICASSP Minneapolis, 1993, pp. 692-695.
    • (1993) Proc. ICASSP Minneapolis , pp. 692-695
    • Bocchieri, E.1
  • 7
    • 0348031434 scopus 로고
    • Extensions to the Approximating and Eliminating Search Algorithm (AESA) for Finding K-Nearest-Neighbours
    • Bubion
    • P. Aibar, A. Juan, E. Vidal, "Extensions to the Approximating and Eliminating Search Algorithm (AESA) for Finding K-Nearest-Neighbours", NATO-ASI, New Advances in Speech Recognition and Coding, Bubion, 1993.
    • (1993) NATO-ASI, New Advances in Speech Recognition and Coding
    • Aibar, P.1    Juan, A.2    Vidal, E.3
  • 8
    • 0027239233 scopus 로고
    • Improvements in Connected Digit Recognition Using Linear Discriminant Analysis and Mixture Densities
    • R. Hab-Umbach, D. GeUer, H. Ney, "Improvements in Connected Digit Recognition Using Linear Discriminant Analysis and Mixture Densities", Proc. ICASSP Minneapolis, 1993, pp 239-292.
    • (1993) Proc. ICASSP Minneapolis , pp. 239-292
    • Hab-Umbach, R.1    GeUer, D.2    Ney, H.3
  • 9
    • 0028996956 scopus 로고
    • Application of Clustering Techniques to Mixture Density Modelling for Continuous-Speech Recognition
    • C. Dugast, P. Beyerlein, R. Hab-Umbach, "Application of Clustering Techniques to Mixture Density Modelling for Continuous-Speech Recognition", Proc. ICASSP'95 Detroit, 1995, Vol. I. pp 524-527.
    • (1995) Proc. ICASSP'95 Detroit , vol.I , pp. 524-527
    • Dugast, C.1    Beyerlein, P.2    Hab-Umbach, R.3
  • 10
    • 33646897819 scopus 로고
    • Large Vocabulary Continuous Speech Recognition of W a l Street Journal Corpus
    • X. Aubert, C. Dugast, H. Ney, V. Steinbiss, "Large Vocabulary Continuous Speech Recognition of W a l Street Journal Corpus", Proc. I C A S S P Adelaide, 1994, Vol. I I. pp 129-132.
    • (1994) Proc. I C A S S P Adelaide , vol.I I , pp. 129-132
    • Aubert, X.1    Dugast, C.2    Ney, H.3    Steinbiss, V.4


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