Indeed, if word w is the hypernym of word x, we may represent this relation by the following constraint y › x, where › is the order operator stating that y is more general than x.
for each set of three synsets (the hypernym synset, the seed synset and the hyponym synset), a list of constraints can be established i.e.