We now present an alternate approximate procedure which can avoid this enumeration making the resulting algorithm much faster than FSAMBR.
the key idea behind this new algorithm is to rewrite the n-gram posterior probability (Equation 4) as follows: where f (e, w, E) is a score assigned to edge e on path E containing n-gram w: e precedes e on E 0 otherwise 6for each path E, we count the edge that contributes n-gram w and has the highest edge posterior probability relative to its predecessors on the path E; there is exactly one such edge on each lattice path E. We note that f (e, w, E) relies on the full path E which means that it cannot be computed based on local statistics.