Let M be the set of all mentions in a given text snippet, and P the set of all pronouns, such that P ⊂ M. We train a coreference model by learning a pairwise mention scoring function.
given a mention-pair (u, v) ∈ M (u is the antecedent of v), we learn a left-linking scoring function ) is a pairwise feature vector and w is the weight vector.