8th European Conference on Speech Communication and Technology

Geneva, Switzerland
September 1-4, 2003


Speech Recognition with Dynamic Grammars Using Finite-State Transducers

Johan Schalkwyk (1), Lee Hetherington (2), Ezra Story (1)

(1) SpeechWorks International, USA
(2) Massachusetts Institute of Technology, USA

Spoken language systems, ranging from interactive voice response (IVR) to mixed-initiative conversational systems, make use of a wide range of recognition grammars and vocabularies. The recognition grammars are either static (created at design time) or dynamic (dependent on database lookup at run time). This paper examines the compilation of recognition grammars with an emphasis on the dynamic (changing) properties of the grammar and how these relate to context-dependent speech recognizers. By casting the problem in the algebra of finite-state transducers (FSTs) we can use the composition operator for fast-and-efficient compilation and splicing of dynamic recognition grammars within the context of a larger precompiled static grammar.

Full Paper

Bibliographic reference.  Schalkwyk, Johan / Hetherington, Lee / Story, Ezra (2003): "Speech recognition with dynamic grammars using finite-state transducers", In EUROSPEECH-2003, 1969-1972.