Anagram Solver

In short An anagram uses exactly the letters of another word or phrase, rearranged, with each letter used exactly once. Checking whether two phrases are anagrams of each other is the reliable direction and it is simple: sort the letters of both after removing spaces and punctuation and folding case, then compare. If the sorted letters match, they are anagrams — "listen" and "silent" both sort to eilnst. Generating anagrams is the harder direction and is limited by the dictionary rather than by the arithmetic, because the number of letter arrangements grows factorially and almost none of them are words. A seven-letter word has 5,040 arrangements and perhaps a handful that mean anything. That is why an anagram generator returns real words from a word list rather than every permutation, and why long phrases return little: the search space is enormous and the valid results are rare. The convention on what to ignore matches the palindrome checker — case, spaces and punctuation do not count, letters do.