can any one tell me how can i find the shortest path length and depth between two words by using WordNet? is there already made function or parser which i can call to find out this?
Ted Pedersen and students (U. of Minnesota) have implemented many algorithms for computing semantic similarity in WordNet. Many of these involve shortest paths in the WordNet hierarchy, as well as incorporating work of others. Following the link below will provide an entry point for many of these algorithms.