Anagram Solver
Find all anagrams of a word, check if two phrases are anagrams, or explore letter rearrangements.
Anagram Solver
Anagram Solver finds words that can be made from the letters you give it, with filtering by length, and a separate checker that tells you whether two words or phrases are anagrams of each other.
How to use it
- Enter a word or phrase to find anagrams from its letters.
- Filter the results by word length.
- Use the second box to check whether two specific words or phrases are anagrams.
How anagram checking works
Two strings are anagrams if they contain exactly the same letters with the same counts. The reliable test is to strip spaces and punctuation, lowercase everything, sort the letters, and compare the results. Listen and silent both sort to eilnst.
Counting letter frequency is the faster equivalent and is what most implementations use, because it avoids sorting and handles long phrases better.
Worked example
Checking a classic pair:
- Firstlisten
- Secondsilent
- Both sortedeilnst
Result: Identical letter multisets, so they are anagrams.
When it helps
- Solving crossword and puzzle clues.
- Finding words in word games from a rack of letters.
- Checking a supposed anagram someone has claimed.
- Generating name or title ideas from a fixed set of letters.
Common mistakes
- Forgetting that anagram checking ignores spaces and punctuation but not letter counts. Two words with the same letters in different quantities are not anagrams.
- Expecting every letter combination to be a real word. The solver is limited to a dictionary, which is what makes the results useful.
