Observe that a constrained document tree is computed on the graph generated in the candidate pair generation step, which already includes recall errors.
the frequencies reported here are computed over the remaining errors.