Crossword solver · ENABLE1, 172,781 words · length locked by the pattern
Every word that fits the squares you have
Type the letters you are sure of and an underscore for each square you are not. The number of squares is the number of letters, so the sieve reads every word of that length in a public-domain dictionary and shows the ones that fit. It counts the words it read, and it says so when nothing fits.
One character per square: a letter you know, or _ (or .) for one you do not; spaces are ignored. ? marks a blank tile on the rack pages and does not work here.
The word index is not loaded yet. It ships as 14 plain-text shards, one per word length, totalling 3,203,788 bytes. A pattern sets its own length, so exactly one of them is pulled, and the figure for yours appears here after a fit.
What is measured
What is measured. Which words in the list are exactly as long as your pattern and have each letter you typed in the square you typed it. Each blank stands for one square and one letter. The matches come back in alphabetical order with no ranking, and the Words that fit figure in the strip counts all of them.
How it is kept. The list ships as a plain text file, wordlist/enable1.txt. Before publication it is split into an index with one file per word length, keyed by each word's sorted letters. Sorting throws away letter positions, so this page loads the one shard for your pattern's length and checks every word in it. The methodology page describes this scan. It covers the words of a single length out of all 172,781 entries; the strip prints how many words were read, and the line under the results prints the bytes pulled.
What it cannot tell you. Which of the fitting words the setter chose. Proper nouns, phrases and abbreviations are not in the list, and crossword answers are often exactly those.
The pattern sets the word length
A nine-square pattern loads the nine-letter file and nothing else, so the eight- and ten-letter words are never searched. That is why the line under the results names a single shard, and why fitting another pattern of the same length fetches nothing. A pattern of only blanks is allowed and lists every word of that length; the page paints at most 1,500 of them, in alphabetical order, and prints the full total. A pattern longer than the longest indexed word is refused with a message, because no word in the dictionary could fill it.