Weighted Determinization and Minimization for Large Vocabulary Speech Recognition

Mehryar Mohri, Michael Riley

Research output: Contribution to conferencePaperpeer-review

Abstract

Speech recognition requires solving many space and time problems that can have a critical effect on the overall system performance. We describe the use of two general new algorithms [5] that transform recognition networks into equivalent ones that require much less time and space in large-vocabulary speech recognition. The new algorithms generalize classical automata determinization and minimization to deal properly with the probabilities of alternative hypotheses and with the relationships between units (distributions, phones, words) at different levels in the recognition system.

Original languageEnglish (US)
Pages131-134
Number of pages4
StatePublished - 1997
Event5th European Conference on Speech Communication and Technology, EUROSPEECH 1997 - Rhodes, Greece
Duration: Sep 22 1997Sep 25 1997

Conference

Conference5th European Conference on Speech Communication and Technology, EUROSPEECH 1997
Country/TerritoryGreece
CityRhodes
Period9/22/979/25/97

ASJC Scopus subject areas

  • Computer Science Applications
  • Software
  • Linguistics and Language
  • Communication

Fingerprint

Dive into the research topics of 'Weighted Determinization and Minimization for Large Vocabulary Speech Recognition'. Together they form a unique fingerprint.

Cite this