Our inference algorithm is inspired by the best-leftlink approach.
the score s(C; d, w) is defined so that each mention links to the antecedent mention (to its left) with the highest score (as long as the score is above some threshold, say, 0).