Word Permutation Solver - Online Anagram All Combinations

An anagram is a word or phrase formed by rearranging the letters of another word or phrase, using all the original letters exactly once. This Word Permutation Solver takes your input letters and generates all possible unique combinations. In Dictionary Words mode, it filters results against a built-in English word list to show only valid words. In All Permutations mode, it shows every possible letter arrangement — useful for cryptography, game solving, and combinatorial exploration.

Dictionary Words mode only shows results that match real English words from our integrated word list — ideal for Scrabble, Words with Friends, crossword puzzles, and word games. All Permutations mode generates every mathematically possible arrangement of the input letters (or subsets thereof), including nonsense strings. This is useful for password analysis, combinatorial math, or when you need to see every possible letter sequence.

The question mark (?) acts as a wildcard that can represent any single letter (a-z). For example, entering p?t will find words like pat, pet, pit, pot, put. You can use up to 2 wildcards in your input. Wildcards work in both Dictionary and All Permutations modes, though they're most practical in Dictionary mode since they dramatically increase the number of possible permutations.

Any Subset generates permutations using any number of letters from your input (within the Min/Max length range). For example, with "abc", you'd get 1-letter, 2-letter, and 3-letter results. All Letters only generates permutations that use every single input character — so with "abc", you'd only see 3-letter arrangements. "Any Subset" is great for word games where you can use partial letter sets; "All Letters" is for pure anagram solving.

The number of permutations grows factorially with input length. For n distinct letters, there are n! (n factorial) full-length permutations alone. Including all subset lengths makes the total even larger. For example, 5 letters produce up to ~325 permutations (all subsets), 7 letters produce ~13,700, and 8 letters can exceed 100,000. This tool caps results at 50,000 to keep your browser responsive. Use the Min/Max Length filters and Dictionary mode to keep results manageable.

Absolutely! This solver is perfect for word games. Use Dictionary Words mode with Any Subset to find all playable words from your rack letters. The results are grouped by word length, making it easy to find high-scoring long words or short tactical plays. While our built-in dictionary covers thousands of common English words, it may not include every obscure word found in official Scrabble tournament lists.

The input is limited to 10 characters (including up to 2 wildcards). The tool caps output at 50,000 unique results to ensure fast performance. If your input would generate more, you'll see a warning suggesting you narrow the length range or switch to Dictionary mode. These limits keep the solver responsive on all devices, including mobile phones.

You can click any individual word to copy it to your clipboard (a brief animation confirms the copy). To copy all results at once, click the "Copy All" button in the stats bar — this copies every result across all length groups, separated by commas, ready to paste into a document, chat, or game analyzer.