How Our Anagram Solver Works

How the Main Anagram Solver Processes Your Letters

When you enter letters into the Anagram Solver, the tool first normalises the input.

It:

• converts letters to a consistent case
• removes characters that are not letters or supported wildcards
• counts how many times each letter occurs
• counts any ? wildcards separately

For example:

LISTEN

contains:

• E × 1
• I × 1
• L × 1
• N × 1
• S × 1
• T × 1

A candidate word can only match if its required letters can be built from that available letter pool.

How Exact Anagrams Are Identified

For the main solver, a result is treated as an exact anagram when:

1. the candidate word can be built from the entered letters, and
2. the candidate has the same number of letters as the input.

For example:

LISTEN → SILENT

SILENT requires exactly the letters available in LISTEN and has the same six-letter length.

If Use every letter is selected, the solver restricts the search to words with the same length as the entered letters.

How Shorter Words Are Found

When Use every letter is not selected, the solver can also return shorter words that use only letters available in the input.

For example, a shorter word can be built from some of the letters in LISTEN without being an exact anagram of all six letters.

These shorter matches are shown separately from exact anagrams and grouped by word length.

This distinction is intentional:

• Exact anagram: uses the complete letter set
• Other word you can make: uses an allowed subset of those letters

For the definition and examples, see What Is an Anagram?.

How Wildcards Work

The main solver supports ? as an unknown letter.

For example:

ST?NE

contains four known letters plus one wildcard.

When the solver checks a candidate word, any required letter that is missing from the known input can be covered by an available wildcard.

The current main solver accepts up to three wildcards in one search.

A wildcard represents an unknown letter in the available letter pool. Its position in the typed input does not force that unknown letter to occupy the same position in the result.

How the Filters Work

The main solver can apply additional restrictions before accepting a candidate word.

Starts With

The candidate must begin with the letters entered in Starts with.

Ends With

The candidate must finish with the letters entered in Ends with.

Contains

The candidate must contain the supplied sequence somewhere inside the word.

Minimum and Maximum Length

These settings control which word lengths are searched.

When Use every letter is selected, the tool automatically uses the full input length.

How Results Are Ranked

SolveAnagrams uses a separate common-word ranking dataset to help organise results.

Depending on the selected sorting mode, results can be ordered by:

• relevance/commonness
• word length
• alphabetical order

The ranking system is intended to make familiar answers easier to find, but it does not claim to measure the meaning, quality or suitability of a word for every puzzle.

The Dictionary Sources page explains the underlying word data.

Why the Solver Does Not Generate Every Permutation

A word with many letters can have a very large number of possible arrangements.

Generating every permutation and then checking whether each arrangement is a word would be inefficient.

Instead, SolveAnagrams checks words already present in the relevant word list and asks:

Can this candidate word be built from the letters the user supplied?

This is much more practical for browser-based solving.

How the Multiple Word Anagram Solver Works

The Multiple Word Anagram Solver solves a harder problem.

It must find combinations of several words whose combined letters use the input exactly.

The current tool:

• counts the available letters
• removes the letters of any required word
• builds a list of candidate words that can fit the remaining letters
• searches combinations recursively
• rejects combinations that use unavailable letters
• accepts a result only when no input letters remain

The current interface can search for combinations containing up to four words.

Because multi-word searches can grow very quickly, the tool also uses practical limits on:

• input length
• candidate count
• search time
• search complexity

The heavier search runs in a browser Web Worker so the page is less likely to become unresponsive while combinations are being checked.

How the Name Anagram Solver Works

The Name Anagram Solver uses similar multi-word letter matching, but is tuned for names.

It:

• removes spaces and punctuation from the name
• counts the available letters
• searches exact word combinations
• can allow up to five words
• can require a particular word
• ranks combinations using common-word and readability-oriented heuristics

The solver verifies the letters, not the meaning of the resulting phrase.

A mathematically exact result may therefore still sound unusual.

How the Crossword Anagram Solver Works

The Crossword Anagram Solver combines letter matching with crossword-specific constraints.

It can use:

• anagram letters or fodder
• known answer positions
• answer length
• starts-with filters
• ends-with filters
• contains filters
• exact-use-of-letters mode

The known answer pattern can use ?, _ or . for unknown positions.

The tool does not attempt to understand the complete meaning of a cryptic crossword clue. It matches the letters and structural information you provide.

The final answer should still satisfy the clue’s definition.

For help identifying the fodder and indicator in a British cryptic clue, read Anagram Indicators in Cryptic Crosswords.

How the Celebrity Anagram Solver Works

The Celebrity Anagram Solver does not search the ordinary word database.

It searches a separate curated celebrity-name dataset.

The tool:

• normalises the scrambled input
• removes spaces and punctuation
• compares the available letters with normalised celebrity names
• supports up to three ? wildcards
• can apply a known-name pattern
• can filter by category and name word count
• can restrict results to entries marked as UK

For an ordinary exact search, the normalised letters must match the celebrity name exactly.

The celebrity database is curated and finite, so a real public figure who has not been added cannot appear in the results.

Where the Word Data Comes From

The main word database currently contains 123,468 entries and the separate common-word ranking file contains 29,200 entries.

The current data pack combines:

• broad English coverage derived from the CMU Pronouncing Dictionary (CMUdict)
• common-word ranking data derived from the TextBlob English spelling frequency list
• a small set of SolveAnagrams UK spelling additions and ranking adjustments

The resulting database is UK-focused, but it is not a British-only dictionary and is not an official Collins, Oxford, Cambridge or Scrabble word list.

Full source and licence information is available on Dictionary Sources.

Does SolveAnagrams Send Every Search to an External API?

The custom anagram tools do not need to send each letter search to a paid third-party word-solving API.

After the required data files have loaded, their matching logic runs in the browser.

This statement applies to the custom solving logic itself. Other website services, such as hosting, security, consent management or analytics if enabled, may operate separately from the solver and are covered by the site’s Privacy Policy.

Why Results Can Differ from Another Solver

Two anagram websites may return different answers even when both tools work correctly.

Differences can come from:

• different word databases
• different treatment of rare words
• different spelling variants
• different proper-noun policies
• different ranking methods
• different minimum or maximum word lengths
• game-specific dictionaries
• different handling of punctuation and wildcards

SolveAnagrams aims to make these boundaries transparent rather than presenting its database as universally authoritative.

What Are the Current Limitations?

The tools have practical limitations.

The Word List Is Finite

A real word that is absent from the database cannot appear in the results.

The Database Is Not an Official Game Dictionary

A returned word is not automatically valid in Scrabble or another specific word game.

Multi-Word Searches Are Computationally Harder

Long phrase and name searches may reach browser search limits.

Ranking Is Heuristic

A high-ranked result is not guaranteed to be the intended puzzle answer.

Crossword Meaning Is Not Interpreted Automatically

The crossword tool checks letters and patterns. It does not fully parse the clue’s semantic definition.

Celebrity Coverage Is Curated

A famous person who is not in the celebrity database cannot be identified by that tool.

Report a Problem

If you find:

• a missing word
• an incorrect match
• a missing celebrity
• a tool bug
• a result that does not behave as described

please use the Contact page.

When reporting a solver issue, include the letters you entered, the settings you used and the result you expected where possible.