Further, the nth-best parse can only involve at most n suboptimal parsing decisions, and all but one of these must be involved in one of the second through the n − 1th-best parses.
the basic idea behind this approach to n-best parsing is to first find the best parse, then find the second-best parse, then the third-best, and so on.