메뉴 건너뛰기
Proceedings - International Conference on Pattern Recognition
Volumn 3, Issue , 1996, Pages 23-27
On-line handwriting recognition with constrained N-best decoding
Author keywords

[No Author keywords available]
Indexed keywords

ALGORITHMS; COMPUTATIONAL LINGUISTICS; PATTERN MATCHING; SPEECH RECOGNITION;
EID: 0039281726     PISSN: 10514651     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ICPR.1996.546788     Document Type: Conference Paper
Times cited : (7)
References (8)
  • 1
    • 0004703052 scopus 로고
    • Handwriting recognition with hidden markov models and grammatical constraints
    • Taipei, Taiwan, Dec
    • J. Hu, M. K. Brown, and W. Turin. Handwriting recognition with hidden Markov models and grammatical constraints. In Proc. 4th IWFHR, pages 195-205, Taipei, Taiwan, Dec. 1994.
    • (1994) Proc. 4th IWFHR , pp. 195-205
    • Hu, J.1    Brown, M.K.2    Turin, W.3
  • 2
    • 0029544270 scopus 로고
    • Use of segmental features in HMM based handwriting recognition
    • Vancouver, Canada, Oct
    • J. Hu, M. K. Brown, and W. Turin. Use of segmental features in HMM based handwriting recognition. In Proc. IEEE SMC'9.5, pages 2178-2182, Vancouver, Canada, Oct. 1995.
    • (1995) Proc. IEEE SMC'9.5 , pp. 2178-2182
    • Hu, J.1    Brown, M.K.2    Turin, W.3
  • 3
    • 0016507833 scopus 로고
    • Design of a linguistic statistical decoder for the recognition of continuous speech
    • May
    • E. Jelinek, L. R. Bahl, and R. L. Mercer. Design of a linguistic statistical decoder for the recognition of continuous speech. IEEE Trans. Info. Theory, 21(3):250-256, May 1975.
    • (1975) IEEE Trans. Info. Theory , vol.21 , Issue.3 , pp. 250-256
    • Jelinek, E.1    Bahl, L.R.2    Mercer, R.L.3
  • 4
    • 0024769238 scopus 로고
    • A frame-synchronous network search algorithm for connected word recognition
    • Nov
    • C.-H. Lee and L. R. Rabiner. A frame-synchronous network search algorithm for connected word recognition. IEEE Trans. ASS, 37(11):1649-1658, Nov. 1989.
    • (1989) IEEE Trans. ASS , vol.37 , Issue.11 , pp. 1649-1658
    • Lee, C.-H.1    Rabiner, L.R.2
  • 5
    • 0025627406 scopus 로고
    • The N-best algorithm: An efficient and exact procedure for finding the n most likely sentence hypotheses
    • R. Schwartz and Y.-L. Chow. The N-best algorithm: An efficient and exact procedure for finding the N most likely sentence hypotheses. In Proc. ICASSP'90, pages 81-84., 1990.
    • (1990) Proc. ICASSP'90 , pp. 81-84
    • Schwartz, R.1    Chow, Y.-L.2
  • 6
    • 0026370988 scopus 로고
    • A tree-trellis based fast search for finding the N best sentence hypotheses in continuous speech recognition
    • Toronto, Canada, May
    • E. K. Soong and E.-E Huang. A tree-trellis based fast search for finding the N best sentence hypotheses in continuous speech recognition. In Proc. ICASSP'91, pages 705-708, Toronto, Canada, May 1991.
    • (1991) Proc. ICASSP'91 , pp. 705-708
    • Soong, E.K.1    Huang, E.-E.2
  • 7
    • 85134888575 scopus 로고
    • Sentence-hypotheses generation in a continuous speech recognition system
    • V. Steinbiss. Sentence-hypotheses generation in a continuous speech recognition system. In Proc. EUROSPEECH'89, pages 51-54, 1989.
    • (1989) Proc. EUROSPEECH'89 , pp. 51-54
    • Steinbiss, V.1
  • 8
    • 0347736246 scopus 로고
    • A stack decoder for continuous speech recognition
    • October
    • D. Sturtemant. A stack decoder for continuous speech recognition. In Proc. Speech and Natural Language Workshop, pages 193-198, October 1989.
    • (1989) Proc. Speech and Natural Language Workshop , pp. 193-198
    • Sturtemant, D.1

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