Enter a word or short phrase (up to 8 letters) to generate every possible anagram, with an option to show only valid English words and filter by word length. Includes famous anagram examples.
An anagram is a word or phrase formed by rearranging the letters of another word or phrase, using every original letter exactly once. The word itself comes from the Greek 'anagrammatismos,' roughly meaning 'to write again in a different order,' and anagram wordplay has been documented for well over two thousand years, from ancient Greek and Hebrew scholars searching for hidden meaning in names to Renaissance-era poets and scientists (including Galileo) who used anagrams to stake a claim on a discovery without fully revealing it, by publishing an anagram of their finding that they could later 'unscramble' to prove priority.
This tool uses two distinct techniques depending on your filter setting. With 'Only valid English words' off, it runs a recursive permutation algorithm that generates every distinct ordering of your input's letters, correctly handling repeated letters so a word like 'letter' doesn't produce needless duplicate results from its two Ts and two Es. With the filter on, it instead checks every word in a large bundled dictionary to see whether it can be built entirely from your input's available letters (respecting exactly how many of each letter you have, so 'tree' can't be formed from a word with only one E) — this dictionary-driven approach is what allows it to surface valid words of any length up to your full input, not just full-length rearrangements.
The naive formula for the number of arrangements of n letters is n factorial (n!), but this overcounts when letters repeat — swapping two identical letters produces the exact same string, not a genuinely new arrangement. This tool's permutation generator correctly deduplicates these cases automatically (using a Set to discard exact-duplicate results), so the count of unique arrangements shown for a word with repeated letters, like 'seesaw' or 'giggle,' is meaningfully lower than a naive n! calculation would suggest, and accurately reflects the true number of distinct rearrangements.
A strict, traditional anagram uses every letter of the original exactly once — 'listen' becomes 'silent,' with nothing left over and nothing added. This tool's dictionary mode intentionally goes a step further, also surfacing valid words using only some of your available letters (subject to the word length filter), which is the more expansive definition used by tile-based word games like Scrabble and Words With Friends when asking 'what words can I make from these letters.' Both are useful for different purposes: strict full-length anagrams for classic wordplay and puzzles, and the broader subset-based search for maximizing your options in a letter-tile game.
Beyond casual wordplay, anagrams show up throughout literature and puzzle culture — pen names and fictional character names are sometimes deliberate anagrams of a real name or a thematically relevant word, cryptic crossword clues frequently rely on anagram indicators to signal that a clue's letters need rearranging, and 'anagram solvers' like this one have long been popular tools for both recreational wordplay and competitive puzzle-solving (crosswords, Scrabble, and word-based game shows). Longer, more elaborate anagrams — entire meaningful phrases rearranged into other meaningful phrases — are especially prized specifically because the more letters involved, the more astronomically unlikely it is for a coherent, unrelated result to exist purely by chance, which is exactly why the small number of famous long anagrams are so celebrated among wordplay enthusiasts.
Anagram Generator rearranges letters into valid words. These related text tools cover other letter and word-level wordplay.