About Anagram Solver

Finds real English-word anagrams using the Datamuse dictionary API. For a given word, it sends parallel queries—one per unique starting letter—to maximize coverage beyond Datamuse’s 1,000-result cap per request, then filters results by comparing sorted letter sequences. If the API fails and the word is 7 letters or fewer, a fallback mode generates all permutations and validates each against the Free Dictionary API in batches of 10.

• Primary method: parallel Datamuse API queries using wildcard patterns (one query per unique starting letter in the input) to work around the 1,000-result-per-query limit
• Anagram validation compares sorted letter arrays—two words are anagrams if and only if their sorted characters are identical
• Fallback for API failures: generates all permutations (factorial growth, capped at 7 letters) and validates against the Free Dictionary API
• Accepts words from 2 to 15 letters; the fallback permutation mode only activates for words of 7 letters or fewer to avoid combinatorial explosion
• Search history tracks your last 10 lookups with result counts and timestamps

Frequently Asked Questions

Why does it sometimes miss anagrams?

Datamuse’s wildcard search returns at most 1,000 results per query. For common letter combinations, some valid words may fall outside those results. The parallel-query-per-starting-letter strategy helps, but very long words with many possible arrangements can still have gaps.

What’s the maximum word length?

15 letters for the Datamuse API path. The permutation fallback caps at 7 letters because 8! = 40,320 permutations and validation requests would be too slow.