From this bipartite graph, we get the maximum weighted matching and use the averaged weight of the matches as the similarity between e i and e j .
we use path_similarity, wup_similarity, res_similarity, jcn_similarity and lin_similarity provided by the nltk.wordnet.similarity (Bird et.