메뉴 건너뛰기




Volumn 3, Issue 7, 1996, Pages 203-205

A training algorithm for statistical sequence recognition with applications to transition-based speech recognition

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; ERRORS; MARKOV PROCESSES; MATHEMATICAL MODELS; NEURAL NETWORKS; OPTIMIZATION; PARAMETER ESTIMATION; PATTERN RECOGNITION; PROBABILITY; PROBLEM SOLVING; STATISTICAL METHODS;

EID: 0030194330     PISSN: 10709908     EISSN: None     Source Type: Journal    
DOI: 10.1109/97.508165     Document Type: Article
Times cited : (8)

References (7)
  • 1
    • 0026835134 scopus 로고
    • Global optimization of a neutral network-hidden markov model hybrid
    • Mar.
    • Y. Bengio, R. De Mori, G. Flammia, and R. Kompe, "Global optimization of a neutral network-hidden markov model hybrid," IEEE Trans. Neural Networks, vol. 3. no. 2, pp. 252-258, Mar. 1992.
    • (1992) IEEE Trans. Neural Networks , vol.3 , Issue.2 , pp. 252-258
    • Bengio, Y.1    De Mori, R.2    Flammia, G.3    Kompe, R.4
  • 2
    • 0343975592 scopus 로고
    • REMAP: Recursive estimation and maximization of a posteriori probabilities, application to transition-based connectionist speech recognition
    • Int. Comput. Sci. Inst., Berkeley, CA
    • H. Bourlard, Y. Konig, and N. Morgan, "REMAP: recursive estimation and maximization of a posteriori probabilities, application to transition-based connectionist speech recognition," Tech. Rep. TR-94-064, Int. Comput. Sci. Inst., Berkeley, CA, 1994.
    • (1994) Tech. Rep. TR-94-064
    • Bourlard, H.1    Konig, Y.2    Morgan, N.3
  • 3
    • 85102488792 scopus 로고
    • REMAP: Recursive estimation and maximization of a posteriori probabilities in connectionist speech recognition
    • Madrid, Spain, Sept.
    • _, "REMAP: recursive estimation and maximization of a posteriori probabilities in connectionist speech recognition," in Proc. Europ. Conf. Speech Commun. Technol. (EUROSPEECH), Madrid, Spain, Sept. 1995.
    • (1995) Proc. Europ. Conf. Speech Commun. Technol. (EUROSPEECH)
  • 6
    • 0002629270 scopus 로고
    • Maximum likelihood from incomplete data via the EM algorithm
    • A. P. Dempster, N. M. Laird, and D. B. Rubin, "Maximum likelihood from incomplete data via the EM algorithm," J. Royal Stat. Soc., Series B, vol. 34, pp. 1-38, 1977.
    • (1977) J. Royal Stat. Soc., Series B , vol.34 , pp. 1-38
    • Dempster, A.P.1    Laird, N.M.2    Rubin, D.B.3
  • 7
    • 0028392167 scopus 로고
    • An application of recurrent nets to phone probability estimation
    • Mar.
    • T. Robinson, "An application of recurrent nets to phone probability estimation," IEEE Trans. Neural Networks, vol. 5, no. 2, pp. 298-305, Mar. 1994.
    • (1994) IEEE Trans. Neural Networks , vol.5 , Issue.2 , pp. 298-305
    • Robinson, T.1


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