Solver · Live
Anagram Solver,
find every word from your letters.
Type any set of scrambled letters and instantly see every valid English word that can be spelled from them, sorted by length, longest first. Perfect for Scrabble, Words with Friends, and unscrambling puzzles.
0 / 15 letters
Enter some letters above
Type 2 or more letters and the solver will instantly find every valid English word that can be spelled from them.
Guide
How to use this anagram solver, and how it works.
An anagram is formed by rearranging the letters of a word to produce a new word, using each letter exactly the same number of times. The classic examples (“listen” ↔ “silent”, “triangle” ↔ “relating”) have delighted word lovers for centuries. But for practical use in word games, what you really need is a sub-anagram solver: a tool that finds every valid word that can be spelled from any subset of your letters.
Using this solver for Scrabble and Words with Friends
Enter the letters on your rack (up to 15) and the solver will instantly return every playable word, grouped by length. The longest words appear at the top because they typically score the most points. Key tips for word game play:
- 7-letter words earn a bingo bonus. In Scrabble, using all 7 tiles in a single play earns a 50-point bonus. In Words with Friends, using all 7 earns 35 bonus points. Always look for full-rack plays first.
- High-value letters first. Q, Z, X, J, and K score more points. Enter your rack and look specifically for words that use those tiles.
- Use the minimum length filter. If you’re looking for high-scoring plays, set “Min length: 5” to focus on longer words and reduce noise from two- and three-letter options.
- Two-letter words are powerful. Short words let you play through existing tiles on the board. All standard two-letter Scrabble words are included in this dictionary.
How the algorithm works
For every word in the dictionary, the solver pre-computes a letter-frequency array: how many times each of the 26 letters appears. When you type input letters, it builds the same array for your rack, then checks every dictionary word: a word is a valid match if and only if every letter it needs appears in your rack at least that many times. This check takes just 26 integer comparisons per word, making it extremely fast; the entire dictionary is searched in milliseconds with no server needed.
What makes a good anagram input?
The more letters you enter, the more words the solver can find — but also the more results to scan. For word games, entering your full rack of 7 tiles is ideal. For puzzle-solving or creative writing, try a specific word you want to unscramble, or a name whose anagram you’re curious about.
Famous anagrams
- listen → silent, inlets, tinsel, enlist
- triangle → relating, alerting, integral
- astronomer → moon starer (phrase)
- conversation → voices rant on (phrase)
- the eyes → they see (phrase)