It is also important to note that the runtime of the n-best algorithm scales much better.
as n increases, the n-best runtime increases as O(n| w| log(| w||P | + n), where P is the set of possible parse productions.