For each candidate, its semantic compatibility with the anaphor could be represented simply in terms of frequency where count(candi, ana) is the count of the tuple formed by candi and ana, or alternatively, in terms of conditional probability (P (candi, ana|candi)), where the count of the tuple is divided by the count of the single candidate in the corpus.
previous approaches to anaphora resolution adopt the singlecandidate model, in which the resolution is done on an anaphor and one candidate at a time (Soon et al., 2001;Ng and Cardie, 2002).