CAEVO uses Algorithm 1 to draw inferences about a data set D. In the original implementation, this set contained only the gold-standard labeled evaluation pairs within two sentence windows.
if D were expanded with other unlabeled data points outside of two sentence windows (for which it is easy to predict labels with high precision), the transitivity constraints in C might generate further high precision predictions on the labeled data.