The n-best parser always represents the n-best parses, which is set to 10,000 in our experiments.
at each iteration we find the n-best parses with the current lexicon, and find the subset of these parses which are correct using DFa equivalence.