A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2012; you can also visit the original URL.
The file type is
IEEE Workshop on Automatic Speech Recognition and Understanding, 2005.
A previous paper by the authors described an algorithm for efficient construction of Weighted Finite State Transducers for speech recognition when high-order context-dependent models of order K > 3 (triphones) with tied state observation distributions are used, and showed practical application of the algorithm up to K = 5 (quinphones). In this paper we give additional details of the improved implementation and analyze the algorithm's practical runtime requirements and memory footprint fordoi:10.1109/asru.2005.1566482 fatcat:phjeljpfkndj5djv5igj5adaoq