ϕ R which selects the first SF s ∈ S(v), such that C R (v, s) > 0 when traversing the trees T 1 .
in order to do so, we have compared the upper bound of the number of SF errors that can be corrected when using reranking and our approach.