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 . Here, this approach is extended to n-gram models with explicit å arcs and right cross-word context.
Bibliographic reference. Novák, Miroslav (2009): "Incremental composition of static decoding graphs", In INTERSPEECH-2009, 1175-1178.