If the probability is non-zero, we add the parse to the n-best list W , otherwise we ignore the parse.
we find parses that the WSJ trained model could have produced but didn't due to search heuristics.