Our main claim is that that the pre-processing approach, coupled with a lexicalized parser outperforms both state-of-the-art postprocessing and in-processing.
the algorithm searches from left to right for a possible candidate, preferring non-adjuncts over adjuncts.