Check if two strings are anagrams, generate every permutation of a word, or group a list of words into anagram families — useful for word puzzles, fuzzy matching, and linguistic analysis.
Lists every distinct rearrangement of the input letters. Capped at 5,040 results (7!) for performance.
Paste a list of words (one per line) and group them by which letters they share.
Two strings are anagrams if they contain the same letters with the same frequency. Sorting characters alphabetically gives a canonical signature — identical signatures imply an anagram pair. The number of distinct permutations of a word is n! / (k₁! · k₂! · …), where n is the total length and kᵢ the count of each repeated letter.