Anagram Solver

Rearrange up to seven letters or compare two inputs for anagram equivalence in your browser. Results are letter arrangements, not dictionary-checked words.

How to use

  1. Pick a Mode — Check whether two words are anagrams, or list every permutation of one word.
  2. Type the Word(s) — Letters only — spaces and punctuation are ignored when comparing.
  3. Read the Result — For check mode, a green or red verdict appears instantly.
  4. Browse Permutations — Permutation mode lists every arrangement (up to 7 letters).

Frequently asked questions

Why is permutation limited to 7 letters?

An 8-letter word produces 40,320 permutations and a 10-letter word produces over 3.6 million. We cap at 7 to keep the browser responsive.

How is the anagram check performed?

Both words are lowercased, stripped of non-letters, and sorted alphabetically. If the sorted strings match, they are anagrams.

Does it find real dictionary words?

No. This tool lists every arrangement of letters. It does not filter against a dictionary.

Are duplicate letters handled?

Yes. We deduplicate identical permutations so each unique arrangement only appears once.

Which dictionary is used?

None. The tool rearranges the letters you type and does not check results against a dictionary.

Does it support blank tiles?

No. A question mark is treated as a literal character in permutation mode, not as a wildcard. Check Pair ignores non-A–Z characters.

Why do results include strings that are not words?

Permutation mode generates arrangements, not verified words. It does not check spelling or whether a result is allowed in a word game.

Is a dictionary downloaded?

No. There is no dictionary download or word-list lookup; comparisons and permutations are calculated in your browser.

Is my input sent anywhere?

No. Everything runs in your browser.

Free Anagram Solver and Permutation Generator

Two tools in one: check whether any two words are anagrams of each other, or generate every possible arrangement of letters from a single word.

Common Uses

  • Solve newspaper anagram puzzles
  • Brainstorm Scrabble and Boggle plays
  • Verify word-puzzle answers
  • Create your own anagram riddles
  • Teach permutations in maths class

How It Works

Anagram checking sorts the letters of both inputs and compares the sorted strings. Permutation generation uses a depth-first recursive algorithm and stores results in a Set to remove duplicates from repeated letters.

Privacy

Everything runs locally. No words are sent to a server.

Related: Word Counter, Letter Counter, Palindrome Checker.

Related free tools

Browse all free tools · Guides and tutorials · PDF tools · Developer tools · Text tools · SEO tools