What is an anagram?
An anagram is a word or phrase formed by rearranging the letters of another, using each letter exactly once. listen and silent are anagrams; so are the eyes and they see. The concept is ancient — anagrams have been used for wordplay, pseudonyms, and puzzles for centuries — and today they’re the engine behind games like Scrabble, Words With Friends, and the daily word puzzles many people start their morning with.
When you’re staring at a rack of letters, finding the words hiding inside them is the whole challenge. An Anagram Solver does that instantly, turning a jumble like t a e into ate, eat, eta, and tea.
Exact anagrams vs. sub-words
There are two different questions you might be asking, and a good solver handles both.
Exact anagrams
An exact anagram uses all of your letters, each exactly once. For listen (six letters), the exact anagrams include silent, enlist, and tinsel — every one uses the same six letters rearranged. This is what people usually mean by “anagram,” and it’s the right mode when you’re checking whether two words are true anagrams of each other.
Sub-words
Sub-words use any subset of your letters. From listen you could make list, line, ten, tile, isle, and dozens more. This is the mode you want for word games, where you score by playing the best word you can build, not necessarily one that uses every tile.
Rule of thumb: use exact mode to verify true anagrams, and sub-words mode to find plays in Scrabble or Words With Friends.
The Anagram Solver lets you switch between the two with a single click, and in sub-words mode you can set a minimum word length to hide short, low-value words.
The clever bit: letter counts
The naive way to solve an anagram is to generate every possible arrangement of the letters and check each against a dictionary. This is a terrible idea. A 7-letter word has 5,040 arrangements; a 10-letter word has over 3.6 million. Generating permutations explodes long before you reach interesting word lengths.
Real solvers don’t do that. They compare letter counts.
Signatures for exact anagrams
Two words are exact anagrams if and only if they contain the same letters the same number of times. The quickest way to check that is to sort each word’s letters into a canonical form — a signature. The signature of both listen and silent is eilnst. If two words share a signature, they’re anagrams. So the solver computes the signature of your input once, then scans the dictionary for words with a matching signature. No permutations required.
1. Normalise
Lowercase the input and strip spaces and punctuation.
2. Build signature
Sort the letters into a canonical key, e.g. eilnst.
3. Match
Find dictionary words whose signature equals yours.
4. Group
Sort results by length, longest first.
Letter pools for sub-words
Sub-words need a slightly different check. A candidate word fits if every letter it needs is available in your pool, in sufficient quantity. The solver counts how many of each letter you have, then for each dictionary word checks that it doesn’t ask for more of any letter than you’ve got. For example, llama needs two L’s, so it only fits if your letters contain at least two L’s. This count comparison is cheap and runs across the whole dictionary in milliseconds.
Why the dictionary is compact
You might wonder why the solver doesn’t simply use a massive dictionary. The answer is speed and privacy. A full Scrabble word list is several megabytes — a noticeable download, and overkill for quick puzzle help. By bundling a curated list of common English words, the Anagram Solver runs entirely in your browser with nothing to download and nothing sent to a server. The trade-off is that rare, technical, or proper-noun words may not appear. For casual play and learning, that’s a good deal.
Tips for word games
- Look for common endings. Suffixes like -ing, -ed, -er, and -s unlock longer words fast.
- Park your high-value tiles. In Scrabble, finding a spot for Q, Z, J, and X is often worth more than a longer common word.
- Use sub-words mode with a minimum length. Filtering out two-letter words keeps the list focused on scoring plays.
- Check the longest group first. The solver sorts results longest-first, and in most games longer words score more.
Beyond games
Anagram solving isn’t only for puzzles. Writers use it to coin clever usernames and brand names. Crossword setters and solvers lean on it for “anagram of…” clues. Teachers turn a child’s spelling list into a quick unscrambling exercise. And it’s a small, satisfying demonstration of an important computer-science idea: that choosing the right representation — letter counts instead of permutations — can turn an impossible brute-force problem into an instant one.
Give it a try with your own letters in the Anagram Solver. If you enjoy tinkering with text, the Text Sorter guide covers another handy everyday text operation.