Although the optimization of the lattice is several orders of magnitude more complex than the decomposition heuristics of<cite> Brooke et al. (2015)</cite> , the time needed to build and optimize the lattice is a fraction of the time required to collect the statistics for LPR calculation, and so the end-to-end runtimes of the two methods are comparable.