<div dir="ltr">Thanks to the <a href="http://gmplib.org" target="_blank">gmplib.org</a> web page, here are a few anagrams for "Wall Street bailout" I think  are relevant to the news:<div><br></div><div><p style="margin:0.0px 0.0px 0.0px 0.0px;font:12.0px Helvetica"> toiletware lust lab</p> <p style="margin:0.0px 0.0px 0.0px 0.0px;font:12.0px Helvetica">lawsuit ballot tree</p> <p style="margin:0.0px 0.0px 0.0px 0.0px;font:12.0px Helvetica">tolerate a swilltub</p> <p style="margin:0.0px 0.0px 0.0px 0.0px;font:12.0px Helvetica">altruist towel bale</p> <p style="margin:0.0px 0.0px 0.0px 0.0px;font:12.0px Helvetica">towel battle is lure</p> <p style="margin:0.0px 0.0px 0.0px 0.0px;font:12.0px Helvetica">reawait lost bullet</p><div><span style="font-family:Helvetica;font-size:12px"><br></span></div><div><span style="font-family:Helvetica;font-size:12px">However, I think there's a problem with the dictionary used for the anagram routine -- try it and you'll see.  It generates an awful lot of non-words like garn and ce as well as single letters; obviously the search would be even quicker if these were eliminated.  By the way, what is the algorithm used?  I read about an idea that coded each letter of the alphabet with a prime number, the most frequent with the smallest primes, and took the target expression as the product of all its letters, then searches for factor words in a (very large) dictionary.  Does this work practically?</span></div> <div><br></div> </div></div>