Publication
INTERSPEECH 2009
Conference paper

Incremental composition of static decoding graphs

Abstract

A fast, scalable and memory-efficient method for static decoding graph construction is presented. As an alternative to the traditional transducer-based approach, it is based on incremental composition. Memory efficiency is achieved by combining composition, determinization and minimization into a single step, thus eliminating large intermediate graphs. We have previously reported the use of incremental composition limited to grammars and left cross-word context [1]. Here, this approach is extended to n-gram models with explicit ε arcs and right cross-word context. Copyright © 2009 ISCA.

Date

Publication

INTERSPEECH 2009

Authors

Topics

Share