메뉴 건너뛰기




Volumn 1, Issue , 1994, Pages I553-I556

New graph search techniques for speech recognition

Author keywords

[No Author keywords available]

Indexed keywords

SIGNAL PROCESSING;

EID: 30244564253     PISSN: 15206149     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ICASSP.1994.389234     Document Type: Conference Paper
Times cited : (9)

References (5)
  • 1
    • 85029982730 scopus 로고    scopus 로고
    • A very fat method for scoring phonetic transcriptions
    • P. Kenny et. al., "A very f a t method for scoring phonetic transcriptions", Proc. Eurosprech 93, pp. 2117-2120.
    • Proc. Eurosprech , vol.93 , pp. 2117-2120
    • Kenny, P.1
  • 2
    • 85079085442 scopus 로고    scopus 로고
    • A new fast match for very large vocabulary continuous speech recognitmion
    • P. Kenny et al., "A new fast match for very large vocabulary continuous speech recognitmion" ICASSP'93, vol. 2, pp. 656-659.
    • ICASSP'93 , vol.2 , pp. 656-659
    • Kenny, P.1
  • 3
    • 0010018471 scopus 로고
    • A∗ - Admissible heuristics for rapid lexical access
    • P. Kenny et al., "A∗ - admissible heuristics for rapid lexical accms", IEEE Transactions OIL Speech and Audio Processing, 1(1) pp. 49-58, 1993.
    • (1993) IEEE Transactions Oil Speech and Audio Processing , vol.1 , Issue.1 , pp. 49-58
    • Kenny, P.1
  • 4
    • 0027189233 scopus 로고
    • Word graphs: An efficient, interface between continuous speech recognition and language understanding
    • April
    • M. Oerder and H. Ney, "Word Graphs: An Efficient, Interface Between Continuous Speech Recognition and Language Understanding", Proc. ICASSP 93, vol. 11, pp. 119-122, April 1993.
    • (1993) Proc. ICASSP'93 , vol.11 , pp. 119-122
    • Oerder, M.1    Ney, H.2


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