Guides · Dictionary
Which words does Word Sieve accept?
A solver can find a word that a game rejects, or miss a word the game accepts. The reason may be the dictionary rather than the letters. Here is a small test you can repeat against the list this site actually ships, followed by a way to check your own game.
By Word Sieve · 31 October 2026 · Suggest a correction
Four words, one fixed edition
The examples below were checked against Word Sieve's published ENABLE1-derived file. They say whether the word is in this edition, not whether a particular game accepts it.
- QAT and QUARTZ are in this file. Both fit within the site's indexed length range.
- QI and ZA are not in this file. A search of this edition cannot return them, even if another dictionary contains them.
Try the pattern solver: enter QA_ using an underscore for the unknown square. In this edition, the three-letter match is QAT. Enter Q_ to look for two-letter entries beginning with Q: this edition has none. These are list-membership examples, not advice about a legal move in a particular game.
Check the judge before the play
- Identify the game and the dictionary edition or rules it currently uses. A competition, an app and a home game can use different lists.
- Check the exact spelling and whether the game accepts that form. A dictionary entry, an allowed inflection and a playable tile combination are separate questions.
- Compare with the solver's result. If the word is missing here but accepted there, the two dictionaries disagree; a different game or edition could give another answer.
- Check the actual board and scoring rules. This solver does not see played tiles, bonus squares or your opponent's rack.
For a disputed move, use the game's own current word checker or agreed reference. Word Sieve does not assert that its list is a game’s own word list.
What exactly was searched?
Word Sieve uses a fixed ENABLE1-derived edition of 172,781 entries, with 39 entries removed before publication. The full file keeps words longer than 15 letters, but the solver indexes lengths 2 through 15. The list is not automatically updated when a game changes its rules or when a new word becomes common.
The provenance record identifies the source, publication filter, word count and file hash. The plain-text edition lets you check the four words yourself: search for a whole line, ignoring letter case. For the pattern example, look for three-letter entries that start with qa.
On a computer with Python, the following reads the saved file without sending a rack to any service:
with open("enable1.txt") as f:
words = set(f.read().split())
for word in (
"qat", "quartz", "qi", "za"
):
print(word, word in words)
Expected output for the recorded edition is True, True, False, False, in that order. Check the file hash in the provenance record if a later downloaded file gives different results. A match confirms the example against that file; it is not a check against another game's dictionary.
Keep the distinction in mind
Use word finder to narrow a rack and word unscrambler to find combinations. The methodology explains the index, publication filter and search limits. If the published file and one of the examples above disagree, tell us which word and page so the example can be checked.