Building all permutations of a certain String and check it against a dictionary efficiently
<p>I have a certain String (from a Radio talkshow), which is an anagram with a length of 15.</p>

<p>What I want to do is to build all permutations efficiently and check them against a dictionary.</p>

<p>This way I want to find out the original word of the anagram.</p>

<p>I already wrote an alogithm, which is working by always merging one letter after the other in the already known permutations.</p>

<p>It is working, but it is too slow. There is never any result shown with 15 chracters (no wonder with 15! possibilities).</p>

<p>So my question is, how to do that faster?</p>