Hi all,
I'm trying to get the shortest distance for all word pairs in WordNet (say, all
word pairs of words in the noun database index.noun) .
The problem is that WordNet database is huge and the perl modules in
WordNet::Similarity is slow and not scalable.
In a very basic approach, if we have ~117,000 nouns, we need 117,000 x 117,000
computations to get the distance between all pairs of words.
This is impossible to do!
Does anyone has experience to overcome on this and want to share it with me?
I tried the demo website of Ted about word similarity and saw that Ted probably
did this before and stored the distances between words in the big tables.
This helped Ted's demo website be very fast.
Thanks a lot.
Best,
Quang
____________________________________________________________________________________
Never miss a thing. Make Yahoo your home page.
http://www.yahoo.com/r/hs
