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 language | English (US) |
---|---|
Pages | 131-134 |
Number of pages | 4 |
State | Published - 1997 |
Event | 5th European Conference on Speech Communication and Technology, EUROSPEECH 1997 - Rhodes, Greece Duration: Sep 22 1997 → Sep 25 1997 |
Conference
Conference | 5th European Conference on Speech Communication and Technology, EUROSPEECH 1997 |
---|---|
Country/Territory | Greece |
City | Rhodes |
Period | 9/22/97 → 9/25/97 |
ASJC Scopus subject areas
- Computer Science Applications
- Software
- Linguistics and Language
- Communication