메뉴 건너뛰기




Volumn , Issue , 2004, Pages 159-166

A joint source-channel model for machine transliteration

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL LINGUISTICS; LEARNING ALGORITHMS; MACHINE LEARNING; MODELING LANGUAGES; QUANTUM THEORY;

EID: 85149114440     PISSN: 0736587X     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper
Times cited : (204)

References (11)
  • 1
    • 0002629270 scopus 로고
    • Maximum likelihood from incomplete data via the EM algorithm
    • Dempster, A.P., N.M. Laird and D.B.Rubin, 1977. Maximum likelihood from incomplete data via the EM algorithm, J. Roy. Stat. Soc., Ser. B. Vol. 39, pp138
    • (1977) J. Roy. Stat. Soc., Ser. B , vol.39 , pp. pp138
    • Dempster, A.P.1    Laird, N.M.2    Rubin, D.B.3
  • 2
    • 85149113168 scopus 로고    scopus 로고
    • Generate Phonetic Cognates to Handle Name Entities in English-Chinese cross-language spoken document retrieval
    • Helen M. Meng, Wai-Kit Lo, Berlin Chen and Karen Tang. 2001. Generate Phonetic Cognates to Handle Name Entities in English-Chinese cross-language spoken document retrieval, ASRU 2001
    • (2001) ASRU 2001
    • Meng, Helen M.1    Lo, Wai-Kit2    Chen, Berlin3    Tang, Karen4
  • 3
    • 0001882615 scopus 로고
    • Self-organized language modeling for speech recognition
    • Waibel, A. and Lee K.F. (eds), Morgan Kaufmann., San Mateo, CA
    • Jelinek, F. 1991, Self-organized language modeling for speech recognition, In Waibel, A. and Lee K.F. (eds), Readings in Speech Recognition, Morgan Kaufmann., San Mateo, CA
    • (1991) Readings in Speech Recognition
    • Jelinek, F.1
  • 7
    • 0024610919 scopus 로고
    • A tutorial on hidden Markov models and selected applications in speech recognition
    • Rabiner, Lawrence R. 1989, A tutorial on hidden Markov models and selected applications in speech recognition, Proceedings of the IEEE 77(2)
    • (1989) Proceedings of the IEEE , vol.77 , Issue.2
    • Rabiner, Lawrence R.1
  • 8
    • 0025627406 scopus 로고
    • The N-best algorithm: An efficient and Exact procedure for finding the N most likely sentence hypothesis
    • Albuquerque
    • Schwartz, R. and Chow Y. L., 1990, The N-best algorithm: An efficient and Exact procedure for finding the N most likely sentence hypothesis, Proceedings of ICASSP 1990, Albuquerque, pp 81-84
    • (1990) Proceedings of ICASSP 1990 , pp. 81-84
    • Schwartz, R.1    Chow, Y. L.2
  • 10
    • 85119093654 scopus 로고
    • The Onomastica interlanguage pronunciation lexicon
    • The Onomastica Consortium, Madrid, Spain
    • The Onomastica Consortium, 1995. The Onomastica interlanguage pronunciation lexicon, Proceedings of EuroSpeech, Madrid, Spain, Vol. 1, pp829-832
    • (1995) Proceedings of EuroSpeech , vol.1 , pp. pp829-pp832


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