Anagram & Word Puzzle Finder
Enter your available letters to find all valid English words you can make from them — either exact anagrams or any sub-word subset. Filter by minimum length, sort by alphabet or word length, and click any word to copy it.
Anagram & Word Puzzle Finder
Enter your letters — find every valid word you can make from them, filtered by length.
How to Use the Anagram & Word Puzzle Finder
You are staring at a rack of seven Scrabble tiles — A, E, I, N, R, S, T — and you know there is a seven-letter word hiding in there but you cannot see it. This tool takes those letters, runs them against a 370,000-word dictionary, and returns every valid word you can form, grouped by length. The results appear instantly, sorted longest-first so the highest-scoring plays surface at the top.
A standard Scrabble rack holds exactly seven tiles. Switch to Anagram (exact) mode and enter all seven letters to find the eight-letter bingo words that earn a 50-point bonus. If your rack reads A, E, I, N, R, S, T, the tool returns RETINAS, RETSINA, ANESTRI, and NASTIER — all valid seven-letter plays.
A five-letter down clue needs a word ending in -ATE. Enter the letters you already have on the board plus the known ending, then use the minimum-length filter set to 5. The tool surfaces PLATE, ELATE, GRAVITATE, and any other matches so you can pick the one that fits your crossing letters.
In Sub-words mode you can enter up to 20 letters and the tool finds every word of every length. If you hold Q, U, I, Z, you might not find QUIT (missing the second letter), but you will see QUIZ, which scores 33 points on a triple-word square. The length filter narrows results to the words that fit your board position.
Set the minimum length to 6 and enter a thematic letter set like A, E, I, O, U, R, S, T to generate a word-search puzzle for students. The copy-all button exports the entire list so you can paste it straight into a worksheet document.
How the Anagram & Word Puzzle Finder Works
When you press Find Words, the tool converts your input letters into a character frequency map and then scans the loaded dictionary for every word whose frequency map is a subset (Sub-words mode) or exact match (Anagram mode) of your input.
Letter Frequency Mapping
Each input letter is counted into a Map keyed by character. Entering A, E, I, N, R, S, T produces a map with A:1, E:1, I:1, N:1, R:1, S:1, T:1. The same operation is pre-computed for every word in the dictionary when the word list loads. A word like RETINAS produces an identical map, so it matches in Anagram mode. A shorter word like RAIN produces R:1, A:1, I:1, N:1 — a strict subset of the input map, so it matches in Sub-words mode.
Dictionary Indexing and Caching
The word list is fetched from the dwyl/english-words repository (SCOWL-based, 370,000+ entries) on first use. During loading, the tool strips non-alphabetic characters, lowercases every entry, and builds a frequency map for each word. The resulting index is cached in a module-scope variable, so navigating back to the tool from another page within the same session is instant — no re-fetch needed.
Result Grouping and Sorting
After matching, results are collected into an array and then grouped by word length using a Map. The longest words appear first by default. Within each length group, alphabetical sorting is applied. Length-filter tabs are generated dynamically from the Map keys, so if your input produces 3-letter, 5-letter, and 7-letter matches, three tabs appear with counts like 3-letter (12), 5-letter (47), 7-letter (3).
Performance on Large Inputs
With 20 letters in Sub-words mode, the worst-case scan checks all 370,000 dictionary entries against the input frequency map. This completes in under 10 milliseconds on modern hardware because the frequency-map comparison short-circuits early — as soon as any character count exceeds the available count, the check fails and moves to the next word.
Frequently Asked Questions
How do blank tiles or wildcards work?
The tool treats each letter you enter as a single concrete tile. If you have a blank tile in your game, substitute it with any letter that would help form a word — for example, if you want to test whether a blank could be an S, just add an S to your input. The tool will show all valid words using those letters.
What is the maximum number of letters I can enter?
The input field accepts up to 20 letters. This covers every standard Scrabble rack and most practical word-game scenarios. In Sub-words mode with many letters the result count can be large — use the minimum length filter to narrow results quickly.
Which languages and dictionaries are supported?
Currently the tool uses the SCOWL English dictionary via the dwyl/english-words repository, containing over 370,000 words. It is designed for English-language word games. The word list excludes proper nouns, hyphens, and apostrophes to focus on standard dictionary words.
How does the scoring system work?
Results are ranked by word length — longer words appear first when you select the Longest first sort option. Within each length group words are sorted alphabetically. This makes it easy to spot high-value plays in tile-based games where longer words score more points.
Does it work offline?
The word list must be fetched from GitHub the first time you use the tool during a session. Once loaded it is cached in memory, so all subsequent searches in that session run instantly without any network requests. Closing the tab clears the cache.
Is my input data sent to a server?
No. The entire search runs in your browser using JavaScript. The only network request is the initial word-list fetch from a public GitHub repository. No letters, results, or personal data are ever transmitted to any server.