Spelling Bee Solver

Enter the seven letters of a word puzzle and the letter that must appear in every answer, and the page lists the words that fit. The word list is stored inside the page, so the search runs locally with no lookup sent anywhere.

Finding Every Word the Puzzle Will Accept

Word puzzles of this shape give you seven letters and mark one of them as mandatory. The set of valid answers is finite and can be computed exactly, which means the fair way to help someone is to show the whole list rather than drip-feed hints. That is what this page does: you give it the letters, it applies the rules, and the complete answer set comes back sorted with the longest words first.

The Three Rules the Solver Applies

  1. A word must be at least four letters long. Three-letter words are excluded no matter how obvious they look.
  2. Every letter in the word must appear in the seven letters you entered. A word containing any outside letter is rejected on the first character that fails.
  3. The centre letter must appear at least once. A word built entirely from the six outer letters is rejected even if it is otherwise valid.
  4. Letters may be reused as often as you like, so long words are not capped at seven characters — the longest entry in the built-in list runs to sixteen letters.
  5. Words are returned in descending length order, and any word of seven or more letters that uses all seven distinct letters is also flagged as a pangram.

Working Through a Stuck Puzzle

You have the seven letters, you have found most of the short words, and you are short of the target score because something long is hiding. The list is the fastest way to find it.

Differences From the Official Game

The solver applies the puzzle's structural rules exactly — minimum length, letters confined to the set, centre letter mandatory — but it judges words against its own embedded list of 6,068 entries, longest sixteen letters. That list is a general vocabulary, and it is not the same list the official puzzle uses. Treat the output as the set of words that satisfy the rules, not as a guarantee that a particular game will accept each one.

Using It Without Spoiling the Puzzle

A complete answer list is a blunt instrument. Used carelessly it ends the puzzle; used deliberately it unblocks one without ending it.

Puzzle Solver Questions

Why is a three-letter word I expected missing?

Because four letters is the minimum. The filter rejects anything shorter before it checks the letters, so no three-letter word will ever appear regardless of how well it fits the set.

Can I use a letter more than once in a word?

Yes, without limit. The rule is that every letter of the word must exist somewhere in your seven letters and that the centre letter must appear at least once — nothing restricts repetition. That is why the results can contain words considerably longer than seven characters.

What makes a word a pangram here?

It must be at least seven letters long and use all seven distinct letters at least once. Because it uses the whole alphabet you were given, most scoring systems award it the full length plus a bonus, which is why pangrams are listed separately at the top of the result.

Will every word it lists be accepted by the game I am playing?

Not guaranteed. The structural rules are applied exactly, but the vocabulary is the tool's own list of 6,068 words. A specific puzzle may exclude proper nouns, archaic spellings or particular terms, and may include recent words that are absent here. Use the list as strong guidance rather than a ruling.

Does the tool send my letters anywhere?

No. The entire word list is embedded in the page and the filtering runs as ordinary JavaScript on your own device. There is no lookup call, no account, and no record of which letter sets you have tried.

Last verified: October 3, 2026

Launch Spelling Bee Solver

All Tools · All Tools · About · How We Test · Contact · Privacy

Maintained by Huang Bin · Last updated October 3, 2026

Loading Vue Application