19 Nov 1999
Sphinx Speech Group, CMU-SCS (rkm@cs.cmu.edu)
·Again, incremental LM score accumulation:
·
·
·
·
·
·
·
·Still, large computation/memory requirements and overhead for dynamic lextree maintenance
·Multiple LM transitions between some word pairs
Lextree Copies With Explicit Backoff
A
B
unigram lextree
lextree for bigrams of A
lextree for bigrams of B
B
backoff node through which all word exits transition to unigram lextree