This linguistic puzzle tool unscrambles jumbled letters and phrases to discover valid English anagrams and shorter sub-words. Rather than transmitting queries to external server databases, the solver checks character combinations directly against an in-memory dictionary using sorted character signature matching.

### Search Algorithm & Signature Matching The anagram solver processes input queries through the following client-side pipeline:

- **Character Sanitization:** Strips punctuation, numbers, and whitespace, converting letters to lowercase: `input.toLowerCase().replace(/[^a-z]/g, '')`. - **Sorted Signature Generation:** Sorts sanitized input letters alphabetically. For example, the input `SILENT` yields the sorted signature `eilnst`. - **Exact Anagram Evaluation:** Compares the sorted input signature against pre-sorted dictionary words. Any dictionary entry with an identical sorted signature (excluding the original input word itself) is classified as an exact anagram. - **Sub-Anagram Extraction:** For input queries longer than three characters, the engine tests valid dictionary words that can be constructed from a subset of the input characters, displaying up to 40 valid candidate words organized by length.

### Concrete Unscrambling Example Entering the test word **SILENT**: - Sorted Signature: `eilnst` - **Exact Anagram:** `listen` - **Valid Sub-Words:** `inlet`, `tinsel`, `line`, `nest`, `site`, `tile`, `lent` Clicking any returned word copies it to your clipboard for puzzle or game entry.

### Client-Side Privacy Note All string normalization, sorting, and dictionary scans execute locally in your browser memory. No scrambled letters, puzzle inputs, or search queries are sent across a network.