More specifically, in our approach, we use tree fragments to establish the order of correctness between two alternative annotations.
given two trees associated with two annotations, a re-ranker based on tree kernel can be built in the same way of the sequence-based kernel by substituting SK in Eq.