Anagram Solver
Rearrange any set of letters into every real word it forms.
How it works
An anagram, in the strict sense, uses every letter of the original set exactly once to form a different word or phrase — TRIANGLE becomes INTEGRAL, LISTEN becomes SILENT. This tool is built around that classic definition: enter a set of letters and it returns every dictionary word that's a full rearrangement of all of them, rather than every shorter word hiding inside a subset (that's what the Word Unscrambler is for, and the two tools intentionally serve different purposes even though both draw on the same underlying dictionary).
Anagram-solving as a puzzle form goes back centuries — it was a popular literary parlor game in 17th-century Europe, used for pseudonyms and coded scholarly claims, and it remains a foundation of cryptic crossword clue-writing today, where an anagram indicator word in the clue signals that a run of letters needs rearranging to reach the answer.
Under the hood, the solver reduces both your input and every dictionary candidate to a letter-frequency signature (a count of each letter used) rather than generating literal permutations — a 9-letter word has 362,880 possible orderings, which is trivial to filter through frequency-matching but would be needlessly slow to actually enumerate one by one. Two words are anagrams of each other exactly when their letter-frequency signatures are identical.
Blanks (entered as ? or _) work here too, standing in for any one unknown letter — useful for cryptic-crossword solving when you know a clue involves an anagram of a certain length but you're missing a letter or two of the source text.
Tips & strategy
For cryptic crosswords, isolate the anagram fodder first
Cryptic clues bury the anagram inside a full sentence, signaled by a word like "confused," "broken," "wild," or "drunk." Identify exactly which letters the clue is asking you to rearrange (the "fodder") before typing them in — feeding the whole clue in as-is won't work, since the solver expects only the letters meant to be anagrammed.
Longer anagrams often have very few valid answers
The longer your letter set, the fewer real words will use every single letter — an 8- or 9-letter anagram frequently returns just one or two results, which makes it a good confidence check: if the solver returns nothing, double-check you've entered the fodder correctly rather than assuming there's no answer.
Multi-word anagram phrases need to be solved as one letter pool
If you're trying to anagram into a two-word phrase (like a name or a pun), remember the solver only returns single dictionary words — you'll need to manually split the returned candidates or run partial letter sets through the tool separately to build up a phrase.
Watch for anagram pairs hiding in plain sight
Some of the most satisfying anagrams are common words that are also anagrams of each other — practicing spotting them (the solver is a good way to explore this) sharpens the pattern recognition that makes solving cryptic clues faster over time.
FAQ
What's the difference between an anagram and just unscrambling letters?
A true anagram uses every letter in the original set exactly once. Unscrambling is broader — it finds valid words using any subset of the letters you provide, at any length. This tool is built specifically for full-set anagrams; use the Word Unscrambler if you want every word hiding inside a jumble at any length.
Can this solve anagram-style cryptic crossword clues?
It can solve the anagram itself once you've identified which letters in the clue are the "fodder" to rearrange — cryptic clues wrap the anagram in a full sentence with an indicator word, so you'll need to isolate the relevant letters yourself before entering them.
Why do longer letter sets sometimes return zero results?
The longer the set, the rarer it is for a real dictionary word to use every single letter exactly once — it's mathematically expected that many long, arbitrary letter sets simply don't anagram into any word in the ENABLE list, rather than being a bug.
Does it support blanks for unknown letters?
Yes — enter ? or _ for any letter you don't know, and the solver tries every letter of the alphabet in that slot before checking which full rearrangements form real words.