메뉴 건너뛰기




Volumn , Issue , 1998, Pages

BTH: An Efficient Parsing Algorithm for Word-Spotting

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL LINGUISTICS; FORMAL LANGUAGES; SYNTACTICS;

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

References (3)
  • 2
    • 33747716842 scopus 로고
    • Keyword-Spotting in Noisy Continuous Speech Using Word Pattern Vector Subabstraction and Noise Immunity Learning
    • II-85-88
    • Takebayashi, Y., Tsuboi, H., and Kanazawa, H. “Keyword-Spotting in Noisy Continuous Speech Using Word Pattern Vector Subabstraction and Noise Immunity Learning”, Proc. ICASSP '92, II-85-88, 1992.
    • (1992) Proc. ICASSP '92
    • Takebayashi, Y.1    Tsuboi, H.2    Kanazawa, H.3
  • 3
    • 0022896744 scopus 로고
    • An Efficient Word Lattice Parsing Algorithm for Continuous Speech Recognition
    • Tomita, M. “An Efficient Word Lattice Parsing Algorithm for Continuous Speech Recognition”, Proc. ICASSP '86, 1569-1572, 1986.
    • (1986) Proc. ICASSP '86 , pp. 1569-1572
    • Tomita, M.1


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