Anagram Checker
Check whether two words or phrases are anagrams of each other.
✓ Anagram!
A sorted: eilnst (6 letters)
B sorted: eilnst (6 letters)
How anagram checking works
Two strings are anagrams if they contain exactly the same letters in any order, ignoring case, spaces, and punctuation. The simplest algorithm strips non-letters, lowercases both strings, sorts their characters, and compares — if the sorted arrays match, they're anagrams. Classic examples include listen / silent, astronomer / moon starer, and the Morse code / here come dots. For related tools, try the Palindrome Checker or Letter Counter.
Related Text Tools tools
Case Converter
Convert between Sentence, Title, camelCase, snake_case, and more.
Word Counter
Count words, characters, and analyze keyword density.
Text to Binary
Convert text into its 8-bit binary representation.
Binary to Text
Decode 8-bit binary back into readable text.
Text Reverser
Reverse text by characters, words, or lines.
Remove Duplicate Lines
Delete repeated lines and keep your list unique.
Remove Empty Lines
Strip blank and whitespace-only lines from text.
Sort Lines Alphabetically
Sort lines A–Z or Z–A, case-sensitive or not.