Exact anagrams

This page explains the bundled dictionary, how unscramble and anagram matching work in the browser, and what official game lists may differ.

Dictionary source

Version 1 ships with an ENABLE-inspired general English sample bundled as words.json (on the order of nine thousand common entries).

Proper nouns, obscure forms, and licensed game lexicons may be absent by design until future imports are documented.

Multiset matching

unscramble() compares each dictionary word against the letter inventory you typed, treating ? as wildcard slots that can consume any unused letter when allowed.

Filters apply length bounds and Starts with / Contains substring checks before or during candidate evaluation per utility-core rules.

Exact anagram mode

anagramsExact() lists words whose length equals the normalized letter count and use precisely those letters, ignoring wildcard characters for the strict check.

Grouped results may still show shorter words formed from subsets of the rack.

Privacy and indexing

Matching executes entirely client-side; letters are not sent to a search backend.

The site does not generate indexable URLs per query string—searches remain on the main solver page.

Dictionary and filtering

Matches come from bundled word lists and filters you enable; enabling stricter dictionaries may empty results that looked valid under a permissive list.

The tool does not upload your letters to SBFChoice for lookup; processing stays in the browser session.

Educational use

Teachers should pair unscramble results with reasoning prompts so students still explain word structure.

Competitive word-game terms of service may forbid external solvers—users must follow third-party rules.