I obviously need a better computer. It's taking mine far too long to compute the social network (Levenshtein distance of 1 words, plus theirs recursively) of a word in a list of 264,000 words
( Read more... )
It occurred to me this morning that if we're removing words from the dictionary as we discover them, we're only going to have a 1 way relationship listed in the networks. I don't think it matters for the test you're doing, but for my alternate design of just identifying the 1 distance words and crawling on demand, it causes problems.
Don't forget that if there's a connection one way, there MUST exist a connection the other way. So if you map everyone's social network, it doesn't matter what path you took to get there, you end up in the same warm fuzzy network.
Also, while that path of solution is the interesting one for repeated queries, it's more work than I think is necessary for the problem I'm looking at.
Comments 2
I don't think it matters for the test you're doing, but for my alternate design of just identifying the 1 distance words and crawling on demand, it causes problems.
Reply
Also, while that path of solution is the interesting one for repeated queries, it's more work than I think is necessary for the problem I'm looking at.
Reply
Leave a comment