Is there any ready way to find a path between two wordnet synsets? NLTK can find me the length of the shortest path, but I would like to have actually a list of the items on the path?If not, is the best implementation just to find hypernyms for both synsets, until they have a common node?
--
You received this message because you are subscribed to the Google Groups "nltk-users" group.
To unsubscribe from this group and stop receiving emails from it, send an email to nltk-users+...@googlegroups.com.
For more options, visit https://groups.google.com/d/optout.