🔤 Anagram Checker: Are Two Words or Phrases Anagrams?

What is the Anagram Checker?

Two strings are anagrams when they contain exactly the same multiset of letters: the same letters, each appearing the same number of times, just in a different order. Order is the only thing allowed to change. The fastest way to test this by hand or by machine is to sort the letters of each phrase. Once both are sorted, anagrams collapse to the identical string, so "listen" and "silent" both become "eilnst". Comparing those two sorted signatures gives a clean yes or no, with no dictionary needed.

Real phrases carry noise that is not part of the puzzle: capital letters, spaces between words, and punctuation. Most people treat "Dirty Room" and "Dormitory" as anagrams even though one has a space and different capitalisation. That is why this tool normalises first: it can lowercase every letter and strip spaces and punctuation before sorting, so only the meaningful letters are compared. You control both behaviours with the checkboxes, which lets you run a strict, case-sensitive test or the relaxed everyday version that most word puzzles assume.

Sorting is not the only method. Counting how many times each letter appears (a letter frequency map) reaches the same answer and makes the difference easy to read when two phrases are close but not equal. This page shows both views: the sorted signatures for a quick visual match, and a frequency table that highlights any letter whose count differs between the two phrases. If every row matches and the totals are equal, the phrases are anagrams. If a single letter is off by one, you can see precisely which one broke the match.

Anagrams have a long history as wordplay and a hidden device in writing. The word itself comes from the Greek "ana" (back, again) and "gramma" (letter), and the form was prized by poets and scholars from antiquity through the Renaissance, when scrambling a name was a fashionable way to flatter or hide it. Modern fiction still leans on them: "Tom Marvolo Riddle" rearranges to "I am Lord Voldemort", "REDRUM" in The Shining is "MURDER" reversed and rearranged, and The Da Vinci Code uses "O, Draconian devil" and "Oh, lame saint" as clues. A good anagram checker lets you confirm a clever claim in seconds rather than counting letters on paper.

It helps to know what an anagram is not. A palindrome reads the same forwards and backwards, like "level" or "racecar", and is about symmetry rather than rearrangement. A pangram is a sentence that uses every letter of the alphabet at least once, such as "The quick brown fox jumps over the lazy dog". A cipher hides a message by substituting letters, not by reordering them. An anagram keeps the exact same letters in the exact same quantities and only changes their order, which is the single rule this checker enforces.

The same letter-comparison logic powers more than party tricks. Programmers meet "check if two strings are anagrams" as a classic interview question, where the sort-and-compare or frequency-map approach is the expected answer. Word-game players use anagram logic to spot bingos in Scrabble and Words With Friends. Teachers use anagram pairs to introduce permutations and frequency analysis. Whatever your reason, this tool gives the verdict plus the working behind it, so you understand why the answer is yes or no.

When to use it

• Settling a debate over whether two words or names are genuine anagrams of each other.
• Checking puzzle, crossword or cryptic-clue answers where the hint says letters have been rearranged.
• Verifying a famous literary anagram such as "Tom Marvolo Riddle" and "I am Lord Voldemort".
• Confirming a tricky multi-word anagram like "Dormitory" and "Dirty room" once spaces are ignored.
• Teaching permutations and letter frequency in a classroom with quick, visual examples.
• Practising the coding interview question "are these two strings anagrams" and checking your own answer.

How to use the Anagram Checker

1. Type or paste the first word or phrase into the First phrase box.
2. Type or paste the second word or phrase into the Second phrase box.
3. Leave Ignore spaces and punctuation ticked to compare letters only, or untick it for a stricter test.
4. Leave Ignore letter case ticked so capitals do not matter, or untick it to treat upper and lower case as different.
5. Read the verdict, then check the two sorted signatures and the letter-count table to see why.

Formula & method

Worked examples

Classic anagram pairs and their shared sorted signature

Famous anagrams from books, film and culture

How each option changes the comparison

Common mistakes to avoid

• Forgetting that every letter must be used once. An anagram uses all the letters of the source, each exactly the same number of times. "Listen" and "Listens" are not anagrams because the second has an extra s, even though it contains all the letters of the first.
• Counting spaces or punctuation as letters. Spaces, commas and apostrophes are usually not part of an anagram. Leave Ignore spaces and punctuation ticked so that "Dirty room" and "Dormitory" are compared on letters alone.
• Letting capital letters break the match. If case sensitivity is on, "Listen" and "silent" will not match because L and l differ. Keep Ignore letter case ticked unless you specifically need a strict, case-sensitive comparison.
• Confusing an anagram with a palindrome. A palindrome reads the same forwards and backwards, like "level". An anagram is a rearrangement of one phrase into another. The two ideas are unrelated, even though both involve reordering letters.
• Accepting a near-anagram that is off by one letter. Phrases can share most of their letters yet still differ. The letter-count table flags any letter whose count is unequal, so a pair that looks right at a glance but fails on a single letter is caught.
• Expecting the tool to invent anagrams for you. This is a checker, not a generator. It confirms whether two phrases you supply are anagrams. To find new words hidden inside a set of letters you would need an anagram solver or generator instead.

Glossary

Anagram

A word or phrase formed by rearranging all the letters of another, using each letter exactly once.

Signature

The letters of a phrase sorted into a fixed order. Anagrams share the same signature.

Normalise

To clean a phrase before comparing it, for example by lowercasing letters and removing spaces and punctuation.

Letter frequency

A count of how many times each letter appears in a phrase. Two phrases are anagrams when their frequencies are equal.

Multiset

A collection that allows repeated members, so it tracks both which letters appear and how many times each one does.

Palindrome

A word or phrase that reads the same forwards and backwards, such as "level". Different from an anagram.

Pangram

A sentence that uses every letter of the alphabet at least once, such as the quick brown fox sentence.

Antigram

An anagram whose rearrangement means the opposite of the original, such as "restful" and "fluster".

Frequently asked questions