We have tested an approximate solution that allows for fast computing.
although the observed word error rate reductions are mostly smaller than the corresponding perplexity reductions, the results are actually very good, when we consider the fact that considerable reductions in perplexity may typically translate into meager word error reductions; see, for instance, Rosenfeld (2000), Goodman (2001).