Each word in SP has to be chosen from a distinct cluster.
given • a particular cluster c in the set of all cluster options • a list W of candidate near-synonyms of c, ordered according to a prespecified criterion (some candidates of the cluster might have already been ruled out because of collocational constraints) • a set P c ⊂ P of compatible preferences, each of which can potentially be satisfied by a word in c, with associated importances: Imp: P → [0, 1] find the first candidate w ∈ W such that WSat(P, w ) is maximized.