메뉴 건너뛰기




Volumn , Issue , 1997, Pages 131-134

Weighted Determinization and Minimization for Large Vocabulary Speech Recognition

Author keywords

[No Author keywords available]

Indexed keywords

CONTINUOUS SPEECH RECOGNITION; PROBABILITY DISTRIBUTIONS; SPEECH PROCESSING; VOCABULARY CONTROL;

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

References (14)
  • 4
    • 0030092596 scopus 로고    scopus 로고
    • On some applications of finite-state automata theory to natural language processing
    • M. Mohri. On some applications of finite-state automata theory to natural language processing. Journal of Natural Language Engineering, 2:1-20, 1996.
    • (1996) Journal of Natural Language Engineering , vol.2 , pp. 1-20
    • Mohri, M.1
  • 5
    • 0348198473 scopus 로고    scopus 로고
    • Finite-state transducers in language and speech processing
    • M. Mohri. Finite-state transducers in language and speech processing. ComputationalLinguistics, 23, 1997.
    • (1997) ComputationalLinguistics , vol.23
    • Mohri, M.1
  • 6
    • 85031617968 scopus 로고    scopus 로고
    • Minimization algorithms for sequential transducers
    • To appear
    • M. Mohri. Minimization algorithms for sequential transducers. Theoretical Computer Science, To appear, 1997.
    • (1997) Theoretical Computer Science
    • Mohri, M.1
  • 7
    • 21444449828 scopus 로고    scopus 로고
    • Weighted automata in text and speech processing
    • Budapest, Hungary. ECAI
    • M. Mohri, F. C. N. Pereira, and M. Riley. Weighted automata in text and speech processing. In ECAI-96 Workshop, Budapest, Hungary. ECAI, 1996.
    • (1996) ECAI-96 Workshop
    • Mohri, M.1    Pereira, F. C. N.2    Riley, M.3
  • 10
    • 0030366694 scopus 로고    scopus 로고
    • Language-model look-ahead for large vocabulary speech recognition
    • University of Delaware and Alfred I.duPont Institute
    • S. Ortmanns, H. Ney, and A. Eiden. Language-model look-ahead for large vocabulary speech recognition. In IC-SLP'96, pages 2095-2098.University of Delaware and Alfred I.duPont Institute, 1996.
    • (1996) IC-SLP'96 , pp. 2095-2098
    • Ortmanns, S.1    Ney, H.2    Eiden, A.3
  • 11
    • 0030375302 scopus 로고    scopus 로고
    • A comparison of time conditioned and word conditioned search techniques for large vocabulary speech recognition
    • University of Delaware and Alfred I.duPont Institute
    • S. Ortmanns, H. Ney, F. Seide, and I. Lindam. A comparison of time conditioned and word conditioned search techniques for large vocabulary speech recognition. In IC-SLP'96, pages 2091-2094.University of Delaware and Alfred I.duPont Institute, 1996.
    • (1996) IC-SLP'96 , pp. 2091-2094
    • Ortmanns, S.1    Ney, H.2    Seide, F.3    Lindam, I.4
  • 13
    • 0027113267 scopus 로고
    • Minimisation of acyclic deterministic automata in linear time
    • D. Revuz. Minimisation of acyclic deterministic automata in linear time. TheoreticalComputer Science, 92:181-189, 1992.
    • (1992) TheoreticalComputer Science , vol.92 , pp. 181-189
    • Revuz, D.1
  • 14
    • 0002247642 scopus 로고    scopus 로고
    • Transducer composition for context-dependent network expansion
    • Rhodes, Greece
    • M. Riley, F. C. N. Pereira, and M. Mohri. Transducer composition for context-dependent network expansion. In Proceedings of Eurospeech'97. Rhodes, Greece, 1997.
    • (1997) Proceedings of Eurospeech'97
    • Riley, M.1    Pereira, F. C. N.2    Mohri, M.3


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