Anagram Solver

What an anagram solver does

An anagram solver takes a pool of letters and finds every real word you can spell from them. Give it the letters in a jumble and it returns the words hiding inside — using each letter no more times than you have it. This is the engine behind solving word-jumble puzzles, finding high-scoring plays in Scrabble and Words With Friends, cracking cryptic-crossword anagram clues, and brainstorming names from a set of initials. This tool accepts up to 15 letters, optionally lets you require certain letters to appear, and groups every result by word length so the longest, most valuable finds rise to the top.

How the matching works

Behind the scenes the tool uses a letter-counting check rather than trying to rearrange letters one permutation at a time. Permuting 15 letters would mean over a trillion orderings — far too slow. Instead, for each candidate word in its dictionary, it tallies how many of each letter the word needs and compares that against how many you supplied. If the word never asks for more of any letter than you have, it can be formed. This runs in a fraction of a second even for a full 15-letter rack, because it scans the word list once and does a quick count for each entry.

Two details shape the results. First, only words of two letters or more are returned; single letters are skipped. Second, the dictionary is a curated list of roughly three thousand common English words, not an exhaustive tournament lexicon. That keeps results clean and recognisable, but it means very obscure or highly inflected words may not appear.

A worked example

Enter the letters STONE. The solver checks each dictionary word against your five letters and returns everything that fits, sorted longest-first:

Each of those words can be spelled using only the letters S, T, O, N, E with no letter reused beyond its single appearance. The tool shows a count — here "Found 9 words" — and lays them out in length groups so that in a word game you can immediately see stone as the full-length play and note as the best fallback.

Using the "must contain" filter

The optional must-contain field narrows results to words that include specific letters — invaluable when you are building off a tile already on a board. Suppose you have the rack STONE but you must play through an N that is already down. Put N in the must-contain box and the solver drops set, so, and to, keeping only words that use an N: stone, note, not, one, no, and on. The required letters are checked against each candidate the same way the main pool is, so a word qualifies only if it genuinely contains all of them.

Practical uses

• Word games. Find the longest legal play from your rack, or every word that fits a constraint, then verify it against your game's own dictionary before playing.
• Crossword anagram clues. Cryptic clues often signal an anagram with words like "mixed," "broken," or "arranged"; feed the fodder letters in and scan the results.
• Jumble and word-scramble puzzles. Recover the original word instantly when you are stuck.
• Brainstorming. Generate short words from a set of initials for project names, usernames, or wordplay.

Tips and common mistakes

• Enter only the letters you actually have. Adding a letter you do not hold produces words you cannot legally make. Spaces and symbols are ignored, so only A–Z matters.
• Longer is not always playable. The solver does not know your board; it finds words that could be made from the letters, not words that fit a particular slot. Use must-contain to add a real constraint.
• Check against your game's dictionary. Because the word list here is a common-word set, a tournament play might exist that this tool omits, and conversely some entries may not be valid in every game's official lexicon.
• Watch letter counts, not just presence. The tool already does this — to spell noon you would need two O's and two N's — so a word is rejected if it needs more of a letter than you supplied.

The dictionary is bundled into the page and all matching happens in your browser, so the letters you enter are never sent to a server.