Last updated October 10, 2026 · Report an error
Two words are anagrams of each other if one can be rearranged to form the other, using exactly the same letters — checking this by hand is easy for short words, but error-prone for longer phrases.
This checker instantly confirms whether two words or phrases are anagrams of each other.
How it works
Enter two words or phrases. The checker normalizes both — converting to lowercase and removing spaces and punctuation — then sorts each one's letters alphabetically and compares the results.
- Enter first word or phrase.
- Enter second word or phrase.
- Click Calculate to see your results.
Examples
"listen" and "silent"
Both words contain exactly the letters e, i, l, n, s, t — sorted alphabetically, they match exactly, confirming they're anagrams.
Who should use it
- Verifying a wordplay puzzle or crossword anagram clue.
- Checking a suspected anagram in a game like Scrabble or word puzzles.
Industry applications
- Word games and puzzle construction
- Language arts and wordplay education
Advantages
- Handles multi-word phrases, not just single words.
- Ignores capitalization and punctuation automatically.
Limitations
- Only checks whether two specific words/phrases are anagrams — doesn't search for or suggest possible anagrams of a single word.
Common mistakes to avoid
- Forgetting that anagram checking is case-insensitive and ignores spaces/punctuation — two phrases that look very different visually can still be true anagrams.
- Assuming any two words with the same length are automatically anagrams — they must contain exactly the same letters, not just the same letter count.
Best practices
- For multi-word phrase anagrams, don't worry about matching word boundaries — only the total combined letters (ignoring spaces) need to match.
Tips
- Anagram checking is a classic introductory programming exercise — sorting each string's characters and comparing the results (exactly what this tool does) is one of the simplest and most common approaches.
Frequently asked questions
Yes, with no signup and no limit on how many pairs you check.
No — both inputs are converted to lowercase before comparison, so "Listen" and "Silent" are still correctly identified as anagrams despite different capitalization.
No — spaces and punctuation are stripped out before comparison, so multi-word phrases like "William Shakespeare" and its famous anagram can still be checked correctly.
"Listen" and "silent" is one of the most commonly cited simple examples — longer, more elaborate anagrams (sometimes entire phrases) are a popular wordplay and puzzle tradition.