Rather than a right-to-left search from each anaphoric NP for the first coreferent NP, we hypothesized that a right-to-left search for a highly likely antecedent might offer more precise, if not generally better coreference chains.
we modify the coreference clustering algorithm to select as the antecedent of NP£ the NP with the highest coreference likelihood value from among preceding NPs with coreference class values above 0.5.