For this reason, the algorithm Then, for each synset S i we compute the set of all candidate semantic ConceptNet triples P conceptnet (S i ) as the union of the triples that contain at least one of the terms in T i .
it aimed at enriching WordNet with semantics containing direct relations-and words overlapping, preventing associations of semantic knowledge on the unique basis of similarity scores (which may be also dependent on algorithms, similarity measures, and training corpora).