Anagram Solver

Enter any letters and this solver returns every word that is a perfect rearrangement of them — words using each letter exactly as many times as it appears in your input, and no letter extra. That is the strict definition of an anagram, and it is exactly what the Scrabble “bingo” and Wordle-style puzzles demand.

Strict anagrams, instantly

The solver treats your letters as a pool with exact counts: “aardvark” has three a’s, so every result must also have exactly three a’s. It then walks a compact dictionary trie with that pool, pruning every branch that cannot consume all letters — which is why even long inputs come back in milliseconds, entirely on your device.

Famous examples to try: listen → silent, inlets, tinsel; admiral → larmaid (not in every dictionary!) — try stars → rats, arts, tars, tsar; binary → brain, braid… type your own rack letters and see.

How this helps in real games

Want partial words too (words made from some of the letters)? Switch to the Word Unscrambler, which includes this solver’s results plus every subset word.

Frequently asked questions

What is an anagram?

An anagram uses every letter exactly once. The letters of “listen” rearrange to “silent” and “inlets”; “table” becomes “bleat” and “babel”. This tool finds every dictionary word that is a perfect rearrangement of your letters.

Why do I get “no words found”?

Many letter sets have no perfect anagram at all. Uncheck nothing here — the solver is already strict — so try the Word Unscrambler, which also accepts words built from a subset of your letters.

Is the anagram dictionary complete?

It covers 350,000+ English word forms (and 150,000+ Portuguese forms), including plurals, verb tenses and uncommon words. Very specialized jargon and proper names are not included.

Can I find multi-word anagrams?

Multi-word phrases need a phrase dictionary, which is out of scope for this tool. Single-word anagrams are found exhaustively and instantly, in your browser.

More word tools