They generate large quantities of parse trees by parsing unlabeled data with two existing parsers and selecting only the sentences for which the two parsers produced the same trees.
the trees produced this way have noise 1 and tend to be short sentences, since it is easier for different parsers to get consistent results.