How Word Unscrambler Matches Letters

Most word unscrambler tools produce incorrect results because they use simple substring matching. They check if a word contains your letters, but they ignore how many of each letter you actually have. This leads to suggestions like SETTLE when your input is LETTER, even though you do not have the S tile required.

Letter Sorting Table uses letter-frequency matching to ensure every suggested word can genuinely be formed from your exact input.

What Is Letter-Frequency Matching

Letter-frequency matching means counting how many times each letter appears in your input, then checking if each candidate word requires more of any letter than you have. If it does, the word is rejected.

For example, if you enter the letters LETTER, the engine counts:

  • L appears 1 time
  • E appears 2 times
  • T appears 2 times
  • R appears 1 time

When the engine evaluates the word SETTLE, it counts:

  • S appears 1 time
  • E appears 2 times
  • T appears 2 times
  • L appears 1 time

SETTLE requires 1 S tile, but your input LETTER contains 0 S tiles. The engine rejects SETTLE because you cannot form it from your available letters.

Why Substring Matching Fails

Substring matching checks if your input contains all the unique letters of a candidate word, ignoring quantity. Since LETTER contains the letters L, E, T, and R, a naive tool would accept any word made from those letters, including words that require more of a particular letter than you have.

This produces false positives. You see words you cannot actually form, which defeats the purpose of an unscrambler.

How Letter-Frequency Matching Works Step by Step

The engine follows these steps for every word in the dictionary:

  1. Count input letter frequencies: Create a map of how many times each letter appears in your input.
  2. Count candidate word frequencies: Create a map of how many times each letter appears in the candidate word.
  3. Compare the two maps: For every letter in the candidate word, check if it appears more times than in your input.
  4. Reject if any letter is insufficient: If the candidate requires more of any letter than you have, skip that word.
  5. Accept if all letters match: If every letter in the candidate word is available in sufficient quantity, include it in the results.

Real Example: PLANET

Enter the letters PLANET. The engine counts:

  • P: 1
  • L: 1
  • A: 1
  • N: 1
  • E: 1
  • T: 1

When evaluating the word PLANE, the engine counts:

  • P: 1
  • L: 1
  • A: 1
  • N: 1
  • E: 1

PLANE requires 1 P, 1 L, 1 A, 1 N, and 1 E. Your input PLANET contains all of these. The engine accepts PLANE as a valid word.

When evaluating the word PANEL, the engine counts:

  • P: 1
  • A: 1
  • N: 1
  • E: 1
  • L: 1

PANEL requires the same letters as PLANE. The engine accepts PANEL.

When evaluating the word PLANTED, the engine counts:

  • P: 1
  • L: 1
  • A: 1
  • N: 1
  • T: 2
  • E: 1
  • D: 1

PLANTED requires 2 T tiles and 1 D tile. Your input PLANET contains only 1 T and 0 D. The engine rejects PLANTED.

Why This Matters

Accurate letter-frequency matching saves you time. You only see words you can actually form, so you do not waste effort trying to build impossible words. This is critical in timed word games where every second counts.

It also builds trust. You know the tool is checking the same constraints you would check manually, so you can rely on its results without second-guessing.

Try It Yourself

Enter any set of letters into the tool and watch the results. Every word returned can be formed from your exact input, no more and no fewer of each letter than you have.

Compare this to other unscramblers that suggest words you cannot build. The difference is letter-frequency matching.