Anagram generator
There are already other tasks relating to finding existing anagrams. This one is about creating them.
Write a (set of) routine(s) that, when given a word list to work from, and word or phrase as a seed, generates anagrams of that word or phrase. Feel free to ignore letter case, white-space, punctuation and symbols. Probably best to avoid numerics too, but feel free to include them if that floats your boat.
It is not necessary to (only) generate anagrams that make sense. That is a hard problem, much more difficult than can realistically be done in a small program; though again, if you feel the need, you are invited to amaze your peers.
In general, try to form phrases made up of longer words. Feel free to manually reorder output words or add punctuation and/or case changes to get a better meaning.
- Task
Write an anagram generator program.
Use a publicly and freely available word file as its word list.
- unixdict.txt from http://wiki.puzzlers.org is a popular, though somewhat limited choice.
- A much larger word list: words_alpha.txt file from https://github.com/dwyl/english-words. May be better as far as coverage but may return unreasonably large results.
Use your program to generate anagrams of some words / phrases / names of your choice. No need to show all the output. It is likely to be very large. Just pick out one or two of the best results and show the seed word/phrase and anagram.
For example, show the seed and one or two of the best anagrams:
- Purefox -> Fur expo
- Petelomax -> Metal expo
.oO(hmmm. Seem to be detecting something of a trend here...)
Raku
Using the unixdict.txt word file by default.
<lang perl6>unit sub MAIN ($in is copy = , :$dict = 'unixdict.txt');
say 'Enter a word or phrase to be anagramed. (Loading dictionary)' unless $in.chars;
- Load the words into a word / Bag hash
my %words = $dict.IO.slurp.lc.words.race.map: { .comb(/\w/).join => .comb(/\w/).Bag };
- Declare some globals
my ($phrase, $count, $bag);
loop {
($phrase, $count, $bag) = get-phrase; find-anagram Hash.new: %words.grep: { .value ⊆ $bag };
}
sub get-phrase {
my $prompt = $in.chars ?? $in !! prompt "\nword or phrase? (press Enter to quit) "; $in = ; exit unless $prompt; $prompt, +$prompt.comb(/\w/), $prompt.lc.comb(/\w/).Bag;
}
sub find-anagram (%subset, $phrase is copy = , $last = Inf) {
my $remain = $bag ∖ $phrase.comb(/\w/).Bag; # Find the remaining letters my %filtered = %subset.grep: { .value ⊆ $remain }; # Find words using the remaining letters my $sofar = +$phrase.comb(/\w/); # Get the count of the letters used so far for %filtered.sort: { -.key.chars, ~.key } { # Sort by length then alphabetically then iterate my $maybe = +.key.comb(/\w/); # Get the letter count of the maybe addition next if $maybe > $last; # Next if it is longer than last - only consider descending length words next if $maybe == 1 and $last == 1; # Only allow one one character word next if $count - $sofar - $maybe > $maybe; # Try to balance word lengths if $sofar + $maybe == $count { # It's an anagram say $phrase ~ ' ' ~ .key and next; # Display it and move on } else { # Not yet a full anagram, recurse find-anagram %filtered, $phrase ~ ' ' ~ .key, $maybe; } }
}</lang>
- Truncated to only show the best few as subjectively determined by me:
Enter a word or phrase to be anagramed. (Loading dictionary) word or phrase? (press Enter to quit) Rosettacode doctor tease word or phrase? (press Enter to quit) thundergnat dragnet hunt word or phrase? (press Enter to quit) Clint Eastwood downcast eliot I contest waldo nose to wildcat