๐ Anagram Generator: Rearrange Letters Into Every Word Combination
By ToolNimba Editorial Team ยท Updated 2026-06-25
Type any word or phrase and this anagram generator rearranges its letters into new combinations instantly. For short inputs it lists every unique arrangement, and for longer inputs it produces a batch of random scrambles so you always get fresh ideas. Everything runs in your browser, so your text never leaves your device.
What is the Anagram Generator?
An anagram is a word or phrase formed by rearranging the letters of another, using each original letter exactly once. The classic example is "listen" and "silent", which share the same six letters in a different order. Anagrams have been used for centuries in puzzles, pen names, and word games, and they are still a favorite trick of crossword setters and Scrabble players today.
This tool does two related jobs. First, it calculates how many distinct arrangements your letters can form using the permutation formula, which divides the factorial of the total letter count by the factorial of each repeated letter group. Second, it actually produces those arrangements. When your cleaned input is seven letters or fewer, it enumerates every unique permutation and lists them. When the input is longer, the number of permutations explodes into the millions or billions, so the tool switches to generating sixty unique random scrambles instead.
The distinction matters because permutation counts grow factorially. A five letter word has at most 120 arrangements, a seven letter word up to 5,040, but a ten letter word can exceed three million. Listing every one of those would freeze any browser, so random sampling is the practical answer for long strings. Each scramble is produced with a Fisher-Yates shuffle seeded by your browser cryptographic random source, which keeps the results evenly distributed.
Note that a pure anagram generator rearranges letters mechanically, it does not check whether the result is a real dictionary word. Most outputs will be nonsense strings, and a handful will be valid words or names. That is exactly what you want when brainstorming usernames, decoding puzzle clues, or scanning for hidden words, because you, not a dictionary, decide which arrangements are meaningful.
When to use it
- Solving crossword, cryptic clue, and puzzle hunt anagrams where the answer is a rearrangement of given letters.
- Brainstorming creative usernames, brand names, or pen names by reshuffling a word you already like.
- Improving your Scrabble, Words With Friends, or Boggle play by spotting which words your tiles can form.
- Teaching permutations and combinatorics, since the tool shows both the count formula and the actual list.
- Generating word scrambles and jumble puzzles for worksheets, party games, or classroom activities.
- Checking whether two words are true anagrams of each other by comparing their letter sets.
How to use the Anagram Generator
- Type a word or phrase into the input box, the default "listen" already shows a full result set.
- Tick "Keep spaces" if you want spacing preserved in the cleaned display, otherwise spaces and punctuation are stripped.
- Read the letter count and the distinct arrangements figure, then scan the results list below.
- Use the Copy button on any row to grab one arrangement, or Copy all to copy the whole list, and press Generate for a fresh random batch on long inputs.
Formula & method
Worked examples
Counting and listing the arrangements of the word "cat".
- The cleaned input is "cat", which has 3 letters, all different.
- Apply the formula: n! / 1 = 3! = 3 x 2 x 1 = 6.
- Because 3 is seven or fewer, the tool enumerates all 6 permutations.
- The results are act, atc, cat, cta, tac, tca.
Result: 6 distinct arrangements, all listed: act, atc, cat, cta, tac, tca.
Handling a word with a repeated letter, "noon".
- The cleaned input is "noon", which has 4 letters: n appears twice and o appears twice.
- Total letters n = 4, so 4! = 24.
- Divide by the repeats: 2! for the two n letters and 2! for the two o letters, giving 24 / (2 x 2) = 6.
- The tool lists the 6 unique arrangements rather than 24, because swapping identical letters does not create a new word.
Result: 6 distinct arrangements, for example noon, nono, onon, onno, nnoo, oonn.
How fast the number of arrangements grows with letter count (all letters distinct)
| Letters (n) | Maximum arrangements (n!) | Tool behaviour |
|---|---|---|
| 3 | 6 | Lists all |
| 4 | 24 | Lists all |
| 5 | 120 | Lists all |
| 6 | 720 | Lists all |
| 7 | 5,040 | Lists all |
| 8 | 40,320 | 60 random scrambles |
| 10 | 3,628,800 | 60 random scrambles |
| 12 | 479,001,600 | 60 random scrambles |
Effect of repeated letters on distinct arrangements
| Word | Letters | Repeats | Distinct arrangements |
|---|---|---|---|
| cat | 3 | none | 6 |
| noon | 4 | n x2, o x2 | 6 |
| level | 5 | l x2, e x2 | 30 |
| banana | 6 | a x3, n x2 | 60 |
| listen | 6 | none | 720 |
Common mistakes to avoid
- Expecting only real words in the output. A letter rearranger produces every ordering, most of which are not dictionary words. It is a generator, not a dictionary, so you scan the list and pick the meaningful results yourself.
- Forgetting that repeated letters reduce the count. People often expect n! arrangements, but if letters repeat the true number is smaller because swapping identical letters does not produce a new arrangement. "noon" has 24 raw orderings but only 6 distinct ones.
- Assuming long phrases will list every anagram. Beyond seven letters the count is in the tens of thousands or far more, which no browser can list. The tool deliberately switches to random scrambles for long inputs, so press Generate repeatedly to explore more.
- Counting spaces and punctuation as letters. The math uses letters only. Spaces, digits, and symbols are stripped before counting, so "to be" is treated as the four letters t, o, b, e unless you simply want the spacing kept in the display.
Glossary
- Anagram
- A word or phrase made by rearranging the letters of another, using every letter exactly once, such as "silent" from "listen".
- Permutation
- An ordered arrangement of a set of items. For letters, each different ordering of the same letters is one permutation.
- Factorial
- The product of all positive integers up to a number, written n!. For example 5! equals 5 x 4 x 3 x 2 x 1, which is 120.
- Distinct arrangements
- The number of unique orderings once duplicate letters are accounted for, calculated as n! divided by the factorial of each repeated letter group.
- Fisher-Yates shuffle
- An algorithm that randomly reorders a list so that every permutation is equally likely, used here to create unbiased random scrambles.
- Scramble
- A single random rearrangement of the input letters, used for long words where listing every permutation is impractical.
Frequently asked questions
Does this anagram generator only show real words?
No. It rearranges letters mechanically and shows every unique ordering, so most results are not dictionary words. You scan the list and choose the arrangements that form real words or names you like.
Why does it list all results for short words but only random ones for long words?
Short words have a manageable number of arrangements, so all unique permutations are listed. Words longer than seven letters can have tens of thousands to billions of arrangements, which would freeze a browser, so the tool generates 60 unique random scrambles instead.
How is the number of distinct arrangements calculated?
It uses the formula n! divided by the product of the factorials of each repeated letter count. So for "level" it is 5! divided by (2! for the two l letters times 2! for the two e letters), which equals 30.
Can I use phrases with spaces and punctuation?
Yes. By default the tool strips spaces, digits, and symbols and works on the letters only. If you tick Keep spaces, the spacing is preserved in the cleaned display, though the arrangement math still counts letters only.
Is my input sent to a server?
No. The entire tool runs in your browser using JavaScript, so your words are never uploaded. You can even use it offline once the page has loaded.
How do I get a different set of random scrambles?
For long inputs, press the Generate button again. Each press runs a fresh cryptographically seeded shuffle and produces a new batch of unique scrambles.