The second one (IB2) corresponds to a standard bootstrapping algorithm which employs pruning after each step in order to reduce semantic drift.
scores are pruned after projecting from X onto Y and from Y onto X, retaining only the top N (t) = N 0 t scores at iteration t and setting all other scores to zero.