Anagram Generator

Rearranges the letters of the text you enter and lists the resulting anagram candidates. Works with Latin letters, digits, and non-Latin scripts alike. Everything runs in your browser, so the text you enter is never sent anywhere.

The text you enter is processed only in your browser and never sent anywhere.

Enter some text and press "Generate".

How to use

Enter the text you want to rearrange (up to 12 characters).
Press "Generate" to list anagram candidates made from the letters you entered.
Press "Copy all results" to copy the list, one arrangement per line.

How it works

How anagrams are generated

The letters of the text you enter are rearranged, and every "true rearrangement" — using exactly the same letters, the same number of times, as the input — is listed. Results are not filtered against a dictionary, so both real words and non-word arrangements are included.

Case sensitivity and whitespace

Uppercase and lowercase are treated as different characters (A and a are distinct). Leading and trailing whitespace is trimmed, but whitespace inside the text is treated as a character and included in the rearrangement.

Handling repeated letters

When a letter appears more than once, arrangements that look identical after swapping the duplicate letters are counted once and shown without duplicates. For example, "aab" has 3 distinct arrangements, not 3! = 6.

Input length limit

Input is limited to 12 characters. The number of possible arrangements grows factorially with length — 12 distinct characters alone already produce about 479 million arrangements — so a limit keeps the calculation practical.

Result count limit

Even when the total number of arrangements is large, only the first 200 are shown. If the actual total is larger, a note such as "Showing the first 200 of N arrangements" is displayed. The display order follows a consistent rule (prioritizing each character's first position of appearance in the input), so the same input always produces the same result.

About data transmission

All calculations happen entirely inside your browser. The text you enter, along with everything else, is never sent to any server.

FAQ

Is the text I enter sent anywhere?

No. All calculations happen entirely in your browser, and no data is ever sent to any external server or API. No dictionary lookups are performed either, so no network requests happen at all.

Are uppercase and lowercase letters treated differently?

Yes. "A" and "a" are treated as distinct characters, so mixed-case input is rearranged with each character kept as-is.

How many characters can I enter, and why is there a limit?

Up to 12 characters. The number of possible arrangements grows factorially with length — 12 distinct characters alone produce about 479 million arrangements — so the input length is capped to keep the calculation practical.

If a letter appears more than once, are duplicate arrangements shown?

No. Arrangements that look identical after swapping duplicate letters are counted once and shown without duplicates. For example, "aab" has 3 distinct arrangements, not the 6 you'd get from 3!.

If there are a lot of results, are they all shown?

Only the first 200 are shown. If the actual total is larger, a note is displayed alongside the first 200 results. The display order is consistent, so the same input always produces the same result.