Word unscrambler: making words from letters
Whether you are stuck in a word game, crafting a catchy name, or testing a child's spelling, a word unscrambler finds every valid word hidden in a jumble of letters. It works by comparing the multiset of your letters against a pre-indexed dictionary, returning all words that can be formed, from short two-letter words to the longest possible anagram.
TL;DR
- The tool counts the frequency of each letter in your input, then scans the dictionary for words whose letter counts fit within those available.
- Dictionary Matching Algorithm: valid(word) ⇔ ∀ letter c: count(word, c) ≤ count(letters, c)
- Example 1: Unscrambling "rndtea" — Input letters: r, n, d, t, e, a
How it works
The tool counts the frequency of each letter in your input, then scans the dictionary for words whose letter counts fit within those available. Every match is returned, usually sorted by length or alphabetically, with optional filters for minimum and maximum word length.
The math
Build a frequency map of the input letters. For each dictionary word, build its frequency map and check that it is a subset of the input map. If every letter of the candidate appears in sufficient quantity in the input, the word is valid.
The subset condition is exact: a word is playable only if it never uses more of a letter than you have, which is the same rule word games apply.
Examples
Example 1: Unscrambling "rndtea"
- Input letters: r, n, d, t, e, a
- Dictionary scan finds all 6-letter anagrams
- "ardent" and shorter words
- Results sorted by length and alphabetically
Example 2: Using filters for a word game
- Letters: s, t, o, p, e, r
- Min length filter: 4 characters
- Results include "stop", "rope", "port", "rest"
- Max length filter narrows to 5-6 letter words: "tropes", "poster"
When to use it
✦ Word Games and Puzzles
Scrabble, Words with Friends, and anagram puzzles are solved by verifying which words your tile rack can legally form.
✦ Writing and Brainstorming
Writers find name candidates and fresh word choices by generating all anagrams of a working set of letters.
⚠ Common Unscrambling Misconceptions
- Expecting Every Word: Dictionary completeness limits results; some proper nouns, archaic words, and regional terms may be absent.
- Ignoring Letter Availability: A word is valid only if you actually hold each of its letters in the required quantity.
- Forgetting Filters: Without length filters, long inputs return hundreds of short words that bury the meaningful answers.
Frequently Asked Questions About Word Unscramblers (5)
How does it work?
It compares the frequency of letters in your input against a pre-indexed dictionary and returns every word that fits.
Can it solve crosswords?
With pattern filters many tools can; at minimum it is ideal for anagram games like Scrabble and Words with Friends.
Is my data kept private when I use these everyday tools?
Yes. Whether it's a word count or a time-between-dates check, nothing is sent to a server. The page does the counting locally — you can paste a draft, get 1,242 words and 6 min reading time, and close it without a trace.
Do I need internet after the first load?
Not really. Once cached, word-counter, hours, fuel-cost and the rest work offline. Handy if you're drafting on a train or counting hours on site without signal — load once, use anywhere.
What's the fastest way to share a result?
'Share Link' does it. It encodes your inputs in the address bar, so the other person sees the exact same hours (e.g. 09:15 to 17:45 = 8h 30m) without you retyping.
Sources & References
How this calculator is maintained
This calculator is written and maintained by Davide Coronese, independent developer and founder of CalcTracker.
Methodology: every formula is checked against official publications and validated by an automated test suite before release. Health, tax and finance pages cite the exact sources they rely on.
Found an error? Contact us — verified corrections ship within 24 hours.