How does the anagram check work?

It compares the letters of each input ignoring spaces, punctuation and case. If both contain exactly the same letters, they are anagrams — so "listen" and "silent" match.

Does the rearranger find real dictionary words?

No — it lists every distinct ordering of your letters and does not download a word list, so it includes non-words. Use it as a starting point for spotting valid words yourself.

Why is there an 8-letter limit on rearranging?

The number of arrangements grows factorially, so beyond 8 letters the list becomes too large to display usefully. The checker mode has no length limit.

What is a famous example of an anagram?

The words listen and silent are a classic pair — they use exactly the same six letters. Dormitory and dirty room is another well-known phrase anagram once spaces are ignored.

How many arrangements do n letters have?

A set of n distinct letters has n factorial (n!) orderings — for example 4 letters give 24 and 6 letters give 720. Repeated letters reduce the number of distinct arrangements.

Anagram Solver & Checker

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.