All Anagrams Generator
Enumerate every letter permutation of a short word.
Overview
This generator enumerates every possible rearrangement of the letters in a short word. Feed it a string and you get back the full set of permutations — duplicates collapsed if letters repeat. It's a brute-force tool, not a dictionary filter, so the output includes nonsense strings as well as real words.
Puzzle setters, crossword writers, Scrabble tinkerers, and code golfers use it to brainstorm anagram clues or to verify how many distinct arrangements a word actually has. It's also useful for cryptanalysis warm-ups when working with short cipher fragments.
How it works
The tool generates permutations using a standard recursive algorithm: fix one letter, permute the rest, repeat. Repeated letters are de-duplicated by tracking which character indices have already been placed at a given position, so "ALL" produces three permutations rather than six. Because permutation counts grow as n factorial, the tool caps the input length — usually around 8 characters — to keep the result set manageable.
Examples
Input: CAT
Output: ACT, ATC, CAT, CTA, TAC, TCA
Input: ABBA
Output: AABB, ABAB, ABBA, BAAB, BABA, BBAA
Input: STOP
Output: 24 permutations including OPTS, POST, POTS, SPOT, STOP, TOPS
FAQ
Why doesn't it filter to real words?
That's the job of the Anagram Finder. This tool's purpose is to show every arrangement, real word or not, so you can pick out interesting candidates yourself.
What's the largest input I can use?
The cap is around 8 letters. A 10-letter input would produce over 3.6 million permutations, which crashes the browser before it's useful.
Are duplicates handled?
Yes. If letters repeat, the tool collapses identical permutations so the count matches the multinomial coefficient.