The Anagram Solver and Checker is two tools in one. It can check whether two words or phrases are anagrams of each other, and it can rearrange a short set of letters to list every possible distinct ordering. It is handy for word games, crosswords, puzzle-making, and settling whether two phrases really are anagrams.
How it works
In Check mode, the tool normalises both inputs by removing spaces and punctuation and lowercasing the letters, then compares the sorted letters of each. If both contain exactly the same multiset of letters, they are anagrams. So “Listen” and “Silent!” match because both reduce to the letters e, i, l, n, s, t.
In Rearrange mode, it generates every distinct permutation of the letters you enter (up to 8 letters, because the count grows factorially). It does not load a dictionary, so the list includes non-words — you scan it yourself for valid words.
Example
Check “listen” against “silent”:
Both sort to e-i-l-n-s-t, so the answer is yes, they are anagrams.
| Input A | Input B | Anagram? |
|---|---|---|
| listen | silent | Yes |
| dormitory | dirty room | Yes |
| hello | world | No |
Everything runs in your browser; nothing is uploaded.
Classic anagram pairs worth knowing
Anagrams have been a puzzle staple for centuries. Some of the most satisfying examples work because the meaning of both words is interestingly related:
| Word A | Word B | Why it’s satisfying |
|---|---|---|
| listen | silent | Opposite actions made of identical letters |
| dormitory | dirty room | The words describe the same place |
| astronomer | moon starer | Same profession, different descriptions |
| school master | the classroom | The role and the place |
| conversation | voices rant on | A conversation literally is that |
Long phrase anagrams — where spaces are removed before checking — allow much richer coincidences than single words.
What factorially means for the rearranging limit
The 8-letter cap on the rearranging mode exists because of how quickly permutations grow:
| Letters | Permutations |
|---|---|
| 4 | 24 |
| 5 | 120 |
| 6 | 720 |
| 7 | 5,040 |
| 8 | 40,320 |
| 9 | 362,880 |
| 10 | 3,628,800 |
Even 9 letters produces nearly 363,000 arrangements — far too many to display usefully or scan for real words. At 8 letters the list is long but scrollable. If you have more than 8 letters and want to find real words, use a dedicated anagram word-finder that filters against a dictionary.
Repeated letters and distinct permutations
When your letters include duplicates, the number of distinct arrangements is smaller than n! would suggest. For example, the letters A, A, B have only three distinct arrangements (AAB, ABA, BAA) rather than six (3! = 6). The tool handles this automatically and only lists distinct arrangements, so you will not see duplicates.
The formula for distinct permutations of letters with repetitions is n! divided by the product of (count of each repeated letter)!. For AABBC it is 5! / (2! × 2!) = 30 distinct arrangements.
Checking long phrases as anagrams
The check mode has no length limit. For phrase anagrams, the tool strips spaces and punctuation and compares only the letters, so you can check whether two famous speeches or quotes are anagrams of each other without manually tallying letters. This is the mode word puzzle designers use to verify their constructions.