How does the default comparison work?

Letters from both strings are lowercased and sorted; spaces and punctuation are ignored. If the sorted letter multisets match, the strings are anagrams.

What does strict mode change?

Strict mode preserves case and counts spaces and punctuation, so "Listen" and "silent" are no longer anagrams under strict rules.

Does it handle Unicode letters?

Yes. Comparison is by Unicode code point, so accented and non-Latin letters count correctly. Combining marks are treated as separate code points.

Where does the check run?

Entirely in your browser. The inputs are not uploaded.

letter-sort comparison · strict / lenient

Check if two words are anagrams

Sorts the letters of both inputs and compares. Lenient mode ignores case, spaces, and punctuation.

Anagram Checker

A length

6 B

B length

6 B

Mode

lenient

letters only

Result

✓ Anagram

sort match

word A

word B

✓

Anagram

Both use: e i l n s t

Quick Start

How to check for anagrams

An anagram rearranges all the letters of one word/phrase to form another. The tool sorts both and compares.

01
Type both words
Drop the two candidate words or phrases into panels A and B — classic pairs like listen / silent, dormitory / dirty room, or longer literary anagrams. The comparison runs live as you type.
Multi-word phrases are fine: lenient mode strips whitespace, so tin sel still matches listen. Both inputs are processed independently through the same normalization pipeline.
word Aword Bphraselive compare
input · pair2 panels
```
listen / silent
```
loaded · readycandidate pair
02
Lenient or strict
Lenient mode (default) lowercases via toLowerCase() and strips everything outside the Unicode \p{L}\p{N} categories — so case, spaces, and punctuation are ignored. This matches how most puzzle and word-game communities define an anagram.
Strict mode keeps every character as-is, requiring identical character sets including capitalization and symbols — useful for cryptographic preservation checks.
lenient defaultstrict modeUnicode \p{L}case-insensitive
mode · lenientletters only
```
Listen ≡ silent
```
case strippeddefault
03
Letter-sort
Both normalized strings are split into code points via Array.from(), then sorted lexicographically and joined. If the resulting sorted strings are byte-equal, the inputs share an identical multiset of letters — the defining property of an anagram.
This is the classic O(n log n) approach and works for any Unicode script. Using Array.from instead of split("") keeps surrogate pairs (emoji, astral chars) intact.
sort + compareO(n log n)Array.fromcode-point safe
sorted formeilnst
```
eilnst === eilnst
```
multiset matchletter identity
04
Verdict
The result panel renders a large ✓ or ✗ badge with the sorted form displayed below, so you can see exactly which letters were considered. The status pill flips between ok and err colors.
Hit Copy result to put a one-line summary (A ↔ ANAGRAM ↔ B) on your clipboard for sharing — all generated in-browser, no server round-trip.
✓ / ✗ verdictsorted form showncopy summarylocal-only
verdict · ✓anagram
```
✓ Anagram
```
ready · localsuccess

Pro tips

Text-processing fundamentals worth knowing

Tokenise with Unicode classes

Use \p{L}\p{N} with the u flag so accents, ideographs, and emoji count properly.

Normalise line endings

Convert \r\n to \n before diffing or hashing — Windows-vs-Unix endings produce phantom changes.

Mind invisible characters

Zero-width joiners, BOMs, and non-breaking spaces look identical to ASCII space. Strip them before comparison or storage.

Stream don’t slurp

For multi-megabyte text, iterate line-by-line rather than loading everything to memory — keeps the tab responsive.

Choose collation deliberately

Default JS sort is code-point order, not human alphabetical. Use Intl.Collator for locale-aware sorting.

Re-run after normalisation

NFC vs NFD changes byte length but not visible glyphs. String.prototype.normalize() before counts and comparisons.

Use Cases

When to check anagrams

Puzzles, games, name fun.

Word puzzles

Confirm whether two words use the same letters. Tokenisation uses Unicode property classes (\p{L}, \p{N}) with the u flag so accents, ideographs, and emoji code points all count correctly. Surrogate-pair-aware counts mean 🚀 weighs 1, not 2.

Unicode-correct

Scrabble

Check if a rearrangement is valid. Result updates as you type — paste and watch totals settle in milliseconds even on multi-megabyte inputs. Heavy work runs through a memoised reducer so the editor never janks.

diff-clean

Author pseudonyms

Find anagram pen names. Output normalises line endings to LF for clean diffs across platforms. Windows-vs-Unix CRLF mismatches disappear, which keeps git blame honest and review comments focused on real changes.

instant counts

Name humour

Discover anagrams of your name. Code-point counts are stable across NFC/NFD normalisation. Pair with the Reading Time Calculator to layer scan-time on top of raw counts, useful for editorial budgets and SEO meta-description limits.

platform-aware

Cryptography demo

Trivial cipher that preserves letter set. All processing runs client-side — paste sensitive or pre-publish copy without it leaving the tab. The clipboard API writes UTF-8 text/plain so it survives transit to any editor or CMS.

code-point-accurate

Crossword help

Test possible answers. Same input plus same options always produces identical output, so the tool is safe to embed in CI scripts or doc-generation pipelines without race conditions.

lossless

FAQ

Frequently asked questions

What's an anagram?

A word/phrase that uses all the same letters as another, possibly in different order.

Lenient vs strict?

Lenient ignores case, spaces, punctuation — typical for puzzles. Strict requires exact character set match.

Multi-word phrases?

Lenient mode handles them by stripping spaces ('listen' ↔ 'tin sel' = anagram).

Unicode?

Letter / digit Unicode (P{L}P{N}) is preserved. Punctuation/space stripped in lenient mode.

Is anything sent to a server?

No. All processing runs locally.

Suggest a tool

Something missing?

Tell us what you need. We ship the top requests every two weeks.

47 in queue·8 shipped this month

Request queued. Thanks!