A generalized composition algorithm for weighted finite-state transducers

Citations Over TimeTop 10% of 2009 papers

Abstract

This paper describes a weighted finite-state transducer composition algorithm that generalizes the concept of the composition filter and presents filters that remove useless epsilon paths and push forward labels and weights along epsilon paths. This filtering permits the compostion of large speech recognition contextdependent lexicons and language models much more efficiently in time and space than previously possible. We present experiments on Broadcast News and a spoken query task that demonstrate an∼5% to 10% overhead for dynamic, runtime composition compared to a static, offline composition of the recognition transducer. To our knowledge, this is the first such system with so little overhead.

Related Papers

• → Is this Finite-State Transducer Sequentiable?(2002)1 cited
• → Disambiguation of finite-state transducers(2002)1 cited
• → Markov Processes with a Finite State Space(2007)1 cited