Word Pattern Finder
Positional Matching and Crossword Helper

How Positional Pattern Matching Works

Your pattern is converted to a regular expression. Each letter becomes a literal character requirement at that position. Each wildcard (?, _, -, .) becomes [a-z] — matching exactly one letter. The resulting regex is tested against every lowercase word in the database.

Pattern length defines word length exactly. C??T is a 4-character pattern, so only 4-letter words are tested. ??ING is a 5-character pattern, so only 5-letter words are tested. You do not need a separate length selector — the pattern itself encodes the required length through its total character count.

This is strictly positional matching. It is not an anagram solver, not a frequency-map search, and not a substring search. Each position in the pattern must be satisfied by the letter (or any letter) at the corresponding position in the candidate word.

Pattern Examples — Verified Against the Database

Crossword Notation — Hyphens and Dots Accepted

Many crossword apps and printed puzzles use hyphens (-) or dots (.) to represent unknown letters. This tool normalises those characters to wildcards automatically. A pattern copied as R--S- from a crossword app works directly in this tool — you do not need to replace the hyphens with question marks first.

Crossword limitation: this tool performs pattern matching only. It does not interpret definitions, check letter crossings for consistency, or use clue meaning. It returns every word that fits the positional pattern. Apply the clue yourself to select the correct answer from the result set.

Positional Matching — Deeper Applications

Positional pattern matching is the most powerful of the three structural word search modes available on this site. Prefix searching constrains only the start. Suffix searching constrains only the end. Pattern matching constrains any combination of positions simultaneously. C??T constrains position 1 (C) and position 4 (T) while leaving positions 2 and 3 free. ?R??T? constrains position 2 (R) and position 5 (T) while leaving four other positions open. This multi-position constraint power makes pattern matching the preferred tool for crossword solving where multiple crossing answers have revealed letters in several positions.

The wildcard system is intentionally simple: each wildcard character represents exactly one unknown letter. This is different from regular expression wildcards where an asterisk can match zero or more characters. In this tool, the pattern length always equals the target word length. A pattern of 8 characters matches only 8-letter words. This simplicity makes the tool predictable: there is no ambiguity about how many letters a wildcard represents.

For Scrabble players, pattern matching solves a specific rack-on-board problem: when existing board tiles create a sequence with gaps. If the board has B at position 1, a gap, L at position 3, another gap, and E at position 5, the pattern B?L?E finds all 5-letter words fitting that sequence: BALES, BOLES, BULGE, BULLE, BYLAE — and any other 5-letter word with B, L, E in those positions. This rack-meets-board search is impossible with prefix or suffix searching alone.

The regex conversion underlying the tool is simple but correct: each wildcard becomes the character class [a-z], matching any single lowercase letter. Each literal letter becomes itself as a lowercase character. The resulting regex is anchored at both ends (start-of-string and end-of-string markers), ensuring that only words of exactly the pattern length match. This anchoring is what guarantees the pattern length equals the word length — a property that makes pattern searching predictable and useful for length-constrained games.

Crossword Notation Support — Hyphen and Dot Wildcards

Many printed crosswords and crossword apps use hyphen or dot characters to indicate unknown positions rather than question marks. A clue might be presented as R--S- or A..LE or _?I?G depending on the application convention. This tool normalises all four wildcard characters — question mark, underscore, hyphen, and dot — to the same single-character wildcard before matching. This means patterns copied directly from crossword notation work without any manual reformatting.

The crossword limitation is worth restating clearly: this tool performs letter-pattern matching only. It does not interpret crossword clue definitions, analyse wordplay, understand abbreviations, or apply cryptic crossword conventions. A clue meaning a type of bird with the pattern ?E?I? would return DEVIL, SERIF, SEMI-colon truncated to SEMI, and many other 5-letter words with E in position 2 and I in position 4. The solver identifies all pattern matches; the human crossword solver applies the clue meaning to select the right answer. This division of labour is the intended workflow.

Pattern matching also handles a specific scenario that neither prefix nor suffix searching can address: the all-wildcard query for a specific length. Entering five question marks ????? returns every 5-letter word in the database — 6,055 words. Entering seven question marks ??????? returns every 7-letter word — 11,882 words. This is equivalent to browsing all words of a given length and is useful for word discovery and game preparation rather than targeted crossword solving.

Pattern Matching — Common Questions

The most common question about pattern matching is how it differs from the missing letter finder. Both tools use positional constraints. The pattern finder accepts any mix of known and unknown positions, while the missing letter finder is optimised for single-letter gaps within otherwise complete words. For patterns with multiple unknowns across various positions, the pattern finder is the right tool.