We build a training set by pairing the mentions sets of the entity-entity pairs from a KB, following the idea discussed in the next section.
we can reduce the analogy task to a binary classification problem, so that p = P ((A, B), (C, D); Θ) is equal to 1 if A : B = C : D, 0 otherwise.