def nearest_common_hypernyms(self, other):
common_hypers = [(dist, synset) for (synset, dist) in<EOL>list(self._common_hypernyms(other).items())]<EOL>if not common_hypers:<EOL><INDENT>return set()<EOL><DEDENT>min_dist = min(x[<NUM_LIT:0>] for x in common_hypers)<EOL>return set(synset for (dist, synset) in common_hypers<EOL>if dist == min_dist)<EOL>
Finds the set of hypernyms common to both this synset and
``other`` which are closest to the two synsets (the hypernyms
which the minimum path length joining the two synsets passes
through).

Arguments:
- `other`: another synset