On the other hand, there are as many as 2|f |(|f |−1) candidate projected dependency instances for the target sentence f .
we need choose a threshold b for C p (i, j) to filter out the ambiguous instances: the instances with C p (i, j) > b are selected as the positive, and the instances with C p (i, j) < 1 − b are selected as the negative.