Anagram Solver

What is an anagram?

An anagram rearranges all the letters of a word into a new one. The precise definition, worked examples, and how it differs from a palindrome or cipher.

An anagram is a word or phrase formed by rearranging all the letters of another word or phrase, using every letter exactly once.

The requirement that every letter is used exactly once is what separates an anagram from a merely similar word. "Listen" and "silent" are anagrams because both use one each of e, i, l, n, s and t. "Listen" and "list" are not: the second discards three letters.

Because the letters are fixed and only their order changes, an anagram preserves the length and the letter counts of the original. That is also what makes anagrams mechanically solvable: sort the letters of any word and you get a fingerprint that every one of its anagrams shares. Two words with the same fingerprint are anagrams of each other, full stop - no judgment call involved.

For the fuller academic definition, including edge cases around punctuation, capitalization and multi-word phrases, see Britannica's entry on the term.

Why anagram-solving engages the brain

Unscrambling letters draws on the same cognitive skills used in chess and competitive word games: pattern recognition, working memory, and rapid mental re-sequencing. Puzzle researchers class it as a combinatorial task rather than a knowledge test, which is part of why it stays engaging even once someone already knows every word in the target set.

Solving an anagram by hand means holding a set of letters in working memory while testing arrangement after arrangement against a mental dictionary. That is a heavier cognitive load than it sounds. Chess players train a related skill: recognizing a familiar pattern inside a jumbled board position before consciously analyzing it.

This is also the reason a solver tool does not make the puzzle pointless. Most word-game players already know that. The satisfaction is in generating the arrangement yourself, not just seeing the answer. A tool like this one is for checking a guess, breaking a stalemate, or finding the highest-scoring word once the fun part is already done.

A short history

The word "anagram" entered English in 1589, borrowed from the Greek for rearranging letters. The practice is older still: Renaissance scientists used anagrams to stake a priority claim on a discovery without revealing it outright, and centuries earlier, Kabbalistic scholars used letter rearrangement to interpret Hebrew scripture.

The word itself was first recorded in the Oxford English Dictionary in 1589, built from the Greek ana- ("back" or "again") and gramma ("letter") - literally, "letters again," reordered. The practice predates the word by centuries.

The most famous historical case is scientific rather than literary. Galileo anagrammed his discovery of Saturn's rings into a scrambled Latin sentence in 1610, sending it to a rival astronomer before publishing the plaintext. If a competitor made the same discovery in the meantime, Galileo could unscramble his own anagram and prove he had gotten there first. All without tipping anyone off by publishing openly.

A separate, older tradition exists in Jewish scriptural interpretation. Kabbalistic scholars practiced temurah, a method of rearranging the letters of a Hebrew word or phrase to surface a second, hidden meaning believed to sit underneath the literal text.

How to make one, step by step

There is a repeatable method, not just trial and error. Start by sorting your source letters alphabetically - that turns a jumble into something scannable. Decide roughly how long your target word or phrase should be relative to your source; a name or short phrase usually anagrams into either one long word or two to three shorter ones.

Work backwards from common letter pairs. English clusters heavily around st, th, er, and ing. If your source letters contain those combinations, that is usually where a real word starts to fall into place - build outward from that cluster rather than starting from the first letter.

Check every candidate against a real dictionary before committing to it, and iterate. Most attempts fail on the first pass - that's normal, not a sign the source phrase has no clean anagram. A tool that checks arrangements mechanically, like the one on this page, is the fast way to confirm a candidate without hand-checking a dictionary yourself.

Anagrams across languages

An anagram is defined relative to one language's alphabet and word list, so the same source letters produce entirely different valid anagrams from language to language. These examples are computed live from the actual dictionaries this site ships, not asserted from memory.

The letters a, c, e, n, r and t rearrange into the French words carnet (notebook) and nectar (nectar) - both real, dictionary-checkable words sharing one set of letters, the same relationship "listen" and "silent" have in English.

German does better with the same six letters in a different combination: a, e, k, n, r and t produce karten (cards), tanker (tanker) and nektar (nectar) - three real nouns from one letter set, one more than the English or French equivalents manage at the same length.

Spanish gives a, a, c, e, r, r and t back as cartera (wallet) and carreta (cart). Spanish and Italian both work with a smaller effective alphabet than English once accented and doubled letters are folded together. That is what changes which anagram sets turn out rich and which stay empty.

What an anagram is not

A palindrome
reads the same forwards and backwards - "level". It involves no rearrangement at all.
A cipher
substitutes letters for other letters or symbols. An anagram substitutes nothing; it only reorders.
A subset of letters
like "list" from "listen" is a partial word, not an anagram, because letters are left over.
An antigram
is an anagram whose meaning opposes the original - "restful" and "fluster".

Anagrams in this dictionary

Every set below was computed from the wordlist this site actually ships, so each one is a genuine, checkable anagram rather than a repeated example.

Common questions

Does an anagram have to use all the letters?

Yes, every letter, exactly once - that is part of the definition, not a house rule. A word built from only some of the letters is a subset instead. Most word games accept subsets too, which is why this solver returns both and lets you filter down to strict anagrams.

Can an anagram be more than one word?

Yes. Phrase anagrams rearrange the letters of a whole phrase, ignoring spaces and punctuation. "Dormitory" and "dirty room" is a well-known example.

What is the easiest way to solve an anagram?

Sort the letters alphabetically to get a fingerprint, then look for dictionary words with the same fingerprint. That is exactly what this solver does, which is why it answers instantly instead of trying every permutation.

How many anagrams can a word have?

Most words have none. A handful have a great many: sets of four or more real English words sharing one set of letters are uncommon but not rare. The examples on this page are drawn from the richest ones in the dictionary.

Is there a trick to solving anagrams quickly?

Sort the letters alphabetically first, then scan for common English letter clusters - st, th, er, ing - inside that sorted string. Real words tend to fall into place around those clusters faster than starting from a random letter.

Try the method above on your own letters in the solver at the top of this page, or work through the German and Spanish examples yourself before checking them against the dictionary.