Why is the input capped at 9 characters?

Permutation count grows as n! / product(duplicate counts). 10! is 3.6 million arrangements; computing and displaying that in a browser would lock the tab. Nine characters is the practical limit.

Do the results have to be real words?

No. The tool generates every mathematically distinct rearrangement of your letters. It does not check a dictionary. Some results will be real words, most will be nonsense — that is normal.

How does it handle duplicate letters?

They are treated as interchangeable. "free" yields 12 unique anagrams rather than 24 because swapping the two e's produces the same string.

What is the difference between "All" and "Sample"?

All returns every unique anagram, capped at 2000 displayed rows. Sample stops at 50 — useful for very long words where you only want a taste of the possibilities.

Why is the original word shown by default?

Because it is a valid arrangement of its own letters. Untick Include the original if you only want strict rearrangements.

Anagram Generator

List every unique rearrangement of a word or short phrase, with a count of total arrangements.

Written by Golam Rabbani, Founder & Lead Engineer

This interactive tool requires JavaScript. Read the formula and worked example below; you can compute the result by hand.

How to use this anagram generator

Type a word or short phrase (letters only, up to 9 characters).
Choose All unique permutations (capped at 2000) or a Sample of 50.
Tick Include the original word if you want it shown in the list.
Press Generate to see every distinct rearrangement.
Use Copy to grab the full list.

About this anagram generator

The anagram generator computes every distinct rearrangement of your input letters using a recursive permutation walk that respects character multiplicity — so the word "free" yields 12 anagrams, not 24, because the two e's are interchangeable. The total count is shown alongside the displayed list so you know how many arrangements exist mathematically, even when the visible list is capped.

Internally the algorithm keeps a count of each remaining letter; at each recursion step it picks one available letter (in alphabetical order for deterministic output), decrements its count, recurses, and restores the count when it backtracks. This produces every unique permutation exactly once and uses O(n × n!) worst-case work, which is why the input is limited to 9 characters — 10! is already 3.6 million arrangements and your browser would freeze.

For example, with input "listen" the generator returns the full 720 unique anagrams including "silent", "tinsel", "enlist", "inlets", "elints". With input "free" you get 12 unique arrangements: free, fere, ferr would-be variations… actually exactly free, frее, refe, reef, eref, ferе, etc. — the total count line at the top tells you 4! / 2! = 12.

FAQ

Why is the input capped at 9 characters?: Permutation count grows as n! / product(duplicate counts). 10! is 3.6 million arrangements; computing and displaying that in a browser would lock the tab. Nine characters is the practical limit.
Do the results have to be real words?: No. The tool generates every mathematically distinct rearrangement of your letters. It does not check a dictionary. Some results will be real words, most will be nonsense — that is normal.
How does it handle duplicate letters?: They are treated as interchangeable. "free" yields 12 unique anagrams rather than 24 because swapping the two e's produces the same string.
What is the difference between "All" and "Sample"?: All returns every unique anagram, capped at 2000 displayed rows. Sample stops at 50 — useful for very long words where you only want a taste of the possibilities.
Why is the original word shown by default?: Because it is a valid arrangement of its own letters. Untick Include the original if you only want strict rearrangements.