We used a t-test to measure the difference between two algorithms in the proportion of correctly resolved anaphors.
there are many examples which are easy (for example, string-matching examples) and that therefore most or all algorithms will resolve correctly, as well as many that are too hard for all algorithms.