and establish cosine similarity-weighted edges between the corresponding triples.
we establish edges only between the triples appearing in k nearest neighbors (lines 3-4): the constructed triple graph G has a clustered structure in which the clusters are sets of SVO triples representing the same frame.