They assume that the easiest types of coreference relationships to resolve are those that occur with high frequencies in the data.
they mine by hand three sets of coreference rules for covering positive instances from the training data by finding the coreference knowledge satisfied by the largest number of anaphor-antecedent pairs.