Searching by Letters and Patterns

Start with the fact you know, then choose the narrowest matching constraint. The query engine combines active constraints with AND: a result must satisfy every length, spelling, sound, tier, and source condition you keep enabled.

Translate the clue into constraints

Use an exact-word query when you are checking one spelling. Use a positional pattern when you know where letters sit, and starts-with, ends-with, or contains when position is only partly known. Use an exact anagram when every supplied letter must be consumed. Use a rack query when a result may consume only some letters or a declared blank tile.

Avoid adding a constraint merely because it looks compatible. If the clue says “contains E”, that does not establish a length or a position. A narrower but unsupported query can hide the answer just as effectively as a broad query can bury it.

Pattern syntax has positional meaning

A letter fixes that position. An underscore (_) means exactly one unknown position. A character class such as [ae] means either A or E in that one position. For example, c_t is three positions long, while c[ae]t permits only CAT or CET-shaped spellings present in the selected source scope. A character class does not add another position.

The interface accepts familiar wildcard spellings such as ?, ., and *, but normalises each one-position wildcard to _. It also sorts and deduplicates the members of a character class. Those aliases are input conveniences, not different searches.

Repeated letters are quantities, not hints

Letter counts are significant. Asking for the unordered letters eel requires at least two Es and one L; one E cannot satisfy both copies. An exact anagram requires the complete multiset: listen and silent match because their six letter counts are identical. A rack query never reuses a tile, and a blank can cover only the number of missing letters explicitly allowed by the query.

This distinction is useful when a puzzle’s rules differ. “Make a word from these tiles” is usually a rack query. “Rearrange all these letters” is an exact anagram. “Must include two Es” is a minimum-count constraint. The product keeps those meanings separate rather than hiding them behind one “letters” box.

Read the scope before treating a result as an answer

Tier and source controls affect which compiled records may appear. A source badge means the normalised spelling occurred in that pinned artifact; it does not establish universal English status or acceptance in a current game. The default usefulness order is a product ranking, while alphabetical order changes presentation only.

Shared interactive states remain noindex and outside sitemaps. Sharing a search gives another person the same normalised tool state; it does not create an approved editorial page.

Build the constraints progressively and inspect why each result matched.

Open the Word Finder

Try the syntax

One-position wildcard

Question-mark input normalises to one underscore position; length is not a separate meaning.

Canonical meaning: pattern c_t; tiers 1, 2

Results load only when requested; no query URL is created.

Require two Es

The unordered letter inventory preserves multiplicity rather than treating E as a set member.

Canonical meaning: 5 letters; minimum letter counts e>=2, l>=1

Results load only when requested; no query URL is created.

Use every submitted letter

Exact anagram mode compares the complete normalized letter multiset.

Canonical meaning: anagrams of listen

Results load only when requested; no query URL is created.

How these statements are supported

One query implementation

The examples post bounded typed states to the same API used by the Finder. Golden cases compare the optimized engine with an independent reference implementation.

Inspect the supporting method or artifact.

Sources

  1. The Word Index canonical query contract, version query-language/2026-07-v1, source date 2026-07-15. Establishes the implemented meanings of patterns, repeated counts, exact anagrams, racks, aliases, and sort state. Licence: The Word Index application licence (MIT). Rights review: pending.
  2. Current lexical data manifest and source register, version 2026.07-lexical.3; build:b5dc0fb56b8de890be69574e89a5505bb2ae0cb90d1033fbce6ecc35d0062d86, source date 2026-07-15. Establishes exact source memberships, versions, transformations, build identity, and declared limitations for this release. Licence: Per-source terms; human source-rights review pending. Rights review: pending.