Thus, they approximate this full computation using beam search, maintaining only the m-best logical forms at each chart cell.
qualitatively, our n-best approximation always represents the most likely parses in the approximation, but the number of represented parses scales only linearly with n. the number of parses represented by the beam search algorithm of the past work can potentially scale exponentially with the beam size, m, due to its use of dynamic programming.