메뉴 건너뛰기




Volumn , Issue , 2006, Pages 803-808

Multiple dimension levenshtein edit distance calculations for evaluating automatic speech recognition systems during simultaneous speech

Author keywords

[No Author keywords available]

Indexed keywords

CHARACTER RECOGNITION; DYNAMIC PROGRAMMING; SPEECH; TEXT PROCESSING;

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

References (9)
  • 2
    • 0001116877 scopus 로고
    • Binary codes capable of correcting deletions, insertions and reversals
    • Levenshtein, V. I. (1966). Binary codes capable of correcting deletions, insertions and reversals, Soviet Physics-Doklady 10, 707-710.
    • (1966) Soviet Physics-Doklady , vol.10 , pp. 707-710
    • Levenshtein, V.I.1
  • 3
    • 33745577702 scopus 로고    scopus 로고
    • The rich transcription 2005 spring meeting recognition evaluation: NIST MLMI meeting recognition workshop, Edinburgh
    • To appear . Renals and S. Bengio, editors
    • Fiscus, J., Radde, N., Garofolo, J., Le, A., Ajot, J., & Laprun, A., (2005). The Rich Transcription 2005 Spring Meeting Recognition Evaluation: NIST MLMI Meeting Recognition Workshop, Edinburgh. To appear in Springer Lecture Notes in Computer Science Series, Volume 3869, S. Renals and S. Bengio, editors.
    • (2005) Springer Lecture Notes in Computer Science Series , vol.3869
    • Fiscus, J.1    Radde, N.2    Garofolo, J.3    Le, A.4    Ajot, J.5    Laprun, A.6


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