About cookies on this site Our websites require some cookies to function properly (required). In addition, other cookies may be used with your consent to analyze site usage, improve the user experience and for advertising. For more information, please review your options. By visiting our website, you agree to our processing of information as described in IBM’sprivacy statement. To provide a smooth navigation, your cookie preferences will be shared across the IBM web domains listed here.
Publication
ICSLP 2004
Conference paper
Memory efficient decoding graph compilation with wide cross-word acoustic context
Abstract
We present an efficient technique for the compilation of static decoding graphs which can utilize full word of left cross-word context. We put an emphasis on memory efficiency, in particular to be able to deploy this technique on platforms with limited resources. The incremental application of the composition process efficiently produces a weighted finite state acceptor which is globally deterministic and minimized with the maximum memory need during the composition essentially the same as that needed for the final graph.