This partial anagram solver will take 2 things: A mask for what the output should look like, and in input character stream. It will then iterate through permutations of that character stream, comparing against a dictionary file to see if words of that length equal that character string. It will pay no mind to making sense of the content, it simply fills in the map with results.