메뉴 건너뛰기




Volumn 21, Issue 4, 1975, Pages 404-411

Decoding for Channels with Insertions, Deletions, and Substitutions with Applications to Speech Recognition

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHM; COMPUTER ANALYSIS; MODEL; NORMAL HUMAN; PATTERN RECOGNITION; SPEECH; THEORETICAL STUDY;

EID: 0016615529     PISSN: 00189448     EISSN: 15579654     Source Type: Journal    
DOI: 10.1109/TIT.1975.1055419     Document Type: Article
Times cited : (123)

References (8)
  • 1
    • 0016507833 scopus 로고
    • The design of a linguistic statistical decoder for the recognition of continuous speech
    • May
    • F. Jelinek, L. R. Bahl, and R. L. Mercer, “The design of a linguistic statistical decoder for the recognition of continuous speech,” IEEE Trans. Inform. Theory, vol. IT-21, pp. 250--256, May 1975.
    • (1975) IEEE Trans. Inform. Theory , vol.IT-21 , pp. 250-256
    • Jelinek, F.1    Bahl, L.R.2    Mercer, R.L.3
  • 2
    • 57849157672 scopus 로고
    • Review of random tree codes
    • Moffett Field, Calif., App. A, Final Rep., Contract NAS2-3637, NASA CR73176, Dec.
    • G. D. Forney, Jr., “Review of random tree codes,” NASA Ames Res. Center, Moffett Field, Calif., App. A, Final Rep., Contract NAS2-3637, NASA CR73176, Dec. 1967.
    • (1967) NASA Ames Res. Center
    • Forney, G.D.1
  • 3
    • 84935113569 scopus 로고
    • Error bounds for convolutional codes and an asymptotically optimal decoding algorithm
    • Apr
    • A. J. Viterbi, “Error bounds for convolutional codes and an asymptotically optimal decoding algorithm,” IEEE Trans. Inform. Theory. vol. IT-13. 00.260--269. Apr, 1967.
    • (1967) IEEE Trans. Inform. Theory. , vol.IT-13 , pp. 260-269
    • Viterbi, A.J.1
  • 4
    • 0014602879 scopus 로고
    • A fast sequential decoding algorithm using a stack
    • Nov.
    • F. Jelinek, “A fast sequential decoding algorithm using a stack,” IBM J. Res. Develop., vol. 13, pp. 675–685, Nov. 1969.
    • (1969) IBM J. Res. Develop. , vol.13 , pp. 675-685
    • Jelinek, F.1
  • 5
    • 84939028230 scopus 로고
    • A stack algorithm for faster sequential decoding of transmitted information
    • Yorktown Heights, N.Y., IBM Res. Rep. RC2441, Apr.
    • F. Jelinek, “A stack algorithm for faster sequential decoding of transmitted information,” IBM Res. Center, Yorktown Heights, N.Y., IBM Res. Rep. RC2441, Apr. 1969.
    • (1969) IBM Res. Center
    • Jelinek, F.1
  • 6
    • 84889483554 scopus 로고
    • Utilization of contextual constraints in automatic speech recognition
    • Jan.
    • R. Alter, “Utilization of contextual constraints in automatic speech recognition,” IEEE Trans. Audio Electroacoust., vol. AU-16, pp. 6–11, Jan. 1968.
    • (1968) IEEE Trans. Audio Electroacoust. , vol.AU-16 , pp. 6-11
    • Alter, R.1
  • 7
    • 0015699045 scopus 로고
    • Application of sequential decoding for converting phonetic to graphemic representation in automatic recognition of continuous speech (ARCS)
    • June
    • C. C. Tappert, N. R. Dixon, and A. S. Rabinowitz, “Application of sequential decoding for converting phonetic to graphemic representation in automatic recognition of continuous speech (ARCS),” IEEE Trans. Audio Electroacoust., vol. AU-21, pp. 225–228, June 1973.
    • (1973) IEEE Trans. Audio Electroacoust. , vol.AU-21 , pp. 225-228
    • Tappert, C.C.1    Dixon, N.R.2    Rabinowitz, A.S.3
  • 8
    • 0016241671 scopus 로고
    • The phonological component of an automatic speech-recognition system
    • Apr.
    • P. S. Cohen and R. L. Mercer, “The phonological component of an automatic speech-recognition system,” in Proc. IEEE Symp. Speech Recognition, Apr. 1974, pp. 177–188.
    • (1974) Proc. IEEE Symp. Speech Recognition , pp. 177-188
    • Cohen, P.S.1    Mercer, R.L.2


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