Text Tools
Anagram Solver - Find All Anagrams Instantly
Find all anagrams and sub-anagrams of any word or phrase. Unscramble letters and discover hidden words. Works entirely in your browser.
What Is the Anagram Solver?
The Anagram Solver instantly finds every word that can be formed from a set of letters. Enter any word or scrambled letters and discover exact anagrams (using all the letters) and sub-anagrams (using some of them), all processed locally in your browser.
What Is an Anagram?
An anagram rearranges all the letters of one word to form another. Classic examples include listen -> silent, race -> care, and eat -> tea. The solver checks every word in its built-in dictionary against the letter multiset you provide.
Sub-Anagrams
Sub-anagrams use some (but not all) of the available letters. They are useful for word games like Scrabble or Words With Friends where partial use of a rack is common.
How the solver works
The solver compares the letter multiset of each word in its built-in dictionary against the letters you enter. A word is a valid anagram if its letter multiset is identical to the input multiset; it is a valid sub-anagram if its multiset is a subset. All processing happens locally in your browser - no server call is made.
Famous anagrams
| Original word | Anagram |
|---|---|
| astronomer | moon starer |
| listen | silent |
| schoolmaster | the classroom |
| debit card | bad credit |
| conversation | voices rant on |
| the Morse code | here come dots |
Scrabble strategy tips
- Use the solver to find bingos: Playing all 7 tiles in one turn earns a 50-point bonus. Enter all 7 rack tiles to find bingo opportunities.
- Treat blank tiles as wildcards: Sub-anagram mode shows shorter words - a blank can stand in for any missing letter to extend plays.
- Prioritize high-value letters: Q, Z, J, and X are worth 8–10 points each. Searching for words containing these letters first can maximize your score.
- Longer words are not always better: A shorter high-value word placed on a triple-word or triple-letter square often outscores a long word on plain squares.
Why longer words produce more results
The number of possible arrangements of n letters grows factorially: 3 letters have 6 arrangements, 5 letters have 120, 7 letters have 5,040. More importantly, sub-anagram results grow with the number of sub-multisets - for n distinct letters there are 2ⁿ − 1 non-empty subsets to check. A 5-letter input checks 31 possible subsets; a 10-letter input checks 1,023. In practice most subsets don't produce valid dictionary words, but the filtering work still scales, which is why results for long or common-letter inputs can number in the hundreds.