Beefy Boxes and Bandwidth Generously Provided by pair Networks
go ahead... be a heretic
 
PerlMonks  

Re: A Better Word Morph Builder

by Solo (Deacon)
on Jun 29, 2006 at 16:58 UTC ( #558380=note: print w/ replies, xml ) Need Help??


in reply to A Better Word Morph Builder

Do you mean Hamming distance?

Crazy idea. Since one can compute the Hamming distance between the initial words, and this is a mininum length of any possible solution path, you can eliminate any paths of shorter length as solutions. Of course, you'd need to know the paths to know the lengths, so this may not be a realizable optimization, but at least you could avoid testing for the solution until you're past the minimum distance. Just trade space for speed and precompute every path.

--Solo

--
You said you wanted to be around when I made a mistake; well, this could be it, sweetheart.


Comment on Re: A Better Word Morph Builder
Re^2: A Better Word Morph Builder
by Limbic~Region (Chancellor) on Jun 29, 2006 at 17:10 UTC
    Solo,
    My EA idea, which is likely flawed, would work as follows:

    Assuming you start with a distance of 7 and the current word is a distance of 3 - any paths that would increase this distance above 3 wouldn't be allowed to survive.

    Do you mean Hamming distance?

    Since we are only using valid words, no path could ever be shorter than the Hamming distance.

    ...but at least you could avoid testing for the solution until you're past the minimum distance.

    love - shit (Hamming Distance = 4) love-lore-sore-sort-soot-shot-shit (Actual Distance = 6)

    Not testing may seem like a win but I doubt it. This is because there is no significant difference between $cur_dist > $min_dist and $word eq $tgt.

    Just trade space for speed and precompute every path

    If you mean precompute every path from every word to any other word it can reach, this certainly would be faster runtime. Unfortunately, I doubt this would be practical. If you mean precompute all paths from the source and then only look at the paths that are beyond the minimum distance, this is a gamble because you won't know how many paths exist beyond the actual solution. The current method is to abort searching when a path is found.

    Cheers - L~R

Log In?
Username:
Password:

What's my password?
Create A New User
Node Status?
node history
Node Type: note [id://558380]
help
Chatterbox?
and the web crawler heard nothing...

How do I use this? | Other CB clients
Other Users?
Others browsing the Monastery: (8)
As of 2014-09-23 23:33 GMT
Sections?
Information?
Find Nodes?
Leftovers?
    Voting Booth?

    How do you remember the number of days in each month?











    Results (241 votes), past polls