Wordle Starting Word Advisor
ExplicitcallerletterweightWordle-starterheuristic,tiesretained,not informationentropyoptimality or hiddenofficialdictionary. Boundedoffline arithmetic/sampling only;not gambling advice,fair physical randomness,secure randomness or predictive certainty.
Description
A Wordle starter heuristic can favor words containing high-weight distinct letters.
A Wordle starter heuristic can favor words containing high-weight distinct letters.1
The result depends on caller-supplied candidates and weights rather than a hidden dictionary or entropy model.
When to use Wordle Starting Word Advisor
Use this tool to apply the stated wordle starting word advisor operation with an explicit input and unit basis.
How to use Wordle Starting Word Advisor and how it works
- Establish the text or game convention described above.
- Enter callerCandidateStartWords, callerMatchedLetterWeights and run the tool.
- Read result.tiedTopCandidates, result.maximumUniqueLetterWeight using the output meanings below.
- If input is rejected, correct the stated type, range, ordering or alignment issue and rerun; review successful results under the declared convention.
| Input field | Meaning | Value type | Requirement |
|---|---|---|---|
| callerCandidateStartWords | Candidate start words, on the basis specified in the algorithm. | array of string | required; dense; align related rows as specified; at most 128 strings; 128 UTF-16 units each; further conditions in the algorithm |
| callerMatchedLetterWeights | 26 nonnegative weights in lowercase a-to-z order. | array of number | required; dense; align related rows as specified; further conditions in the algorithm |
Require 26 nonnegative letter weights and distinct five-letter lowercase candidates. Sum weights once per distinct letter in each word and return every maximum-score tie.
score(word) = Σ weights of distinct letters Apply the declared units, ordering and branch conditions.
| Output field | Meaning | Value type |
|---|---|---|
| result | Object containing the declared output fields. | object |
| result.tiedTopCandidates | Every maximum-score candidate, in original candidate order. | array |
| result.maximumUniqueLetterWeight | Maximum sum of distinct-letter weights. | number |
{
"input": {
"callerCandidateStartWords": [
"crane",
"slate"
],
"callerMatchedLetterWeights": [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1
]
},
"output": {
"result": {
"tiedTopCandidates": [
"crane",
"slate"
],
"maximumUniqueLetterWeight": 5
}
}
}Limitations and assumptions
The output applies the declared operation to the values you supply. Establish the measurement basis, units, coefficients and any caller-selected rules before interpreting it. The tool does not independently collect or verify observations or decide whether a model or reference applies.
Supply explicit required fields with the documented types and dense aligned arrays. Unknown fields, wrong types and nonfinite numbers are rejected. Branch-specific constraints are explained above. A successful false boolean, negative signed difference, empty slice or unresolved tie is distinct from an input error. Very large inputs or outputs may be rejected by shared resource limits.
Alternative or Complementary methods
For a related operation, use Hangman Word Difficulty Rater. Distinct letter count is a simple declared complexity proxy for an ASCII Hangman word.
For a related operation, use Haiku Syllable Checker. A three-line 5–7–5 pattern can be checked when syllable counts have been independently annotated.
References
-
Wordle Starting Word Advisor — tool.io
Similar or alternative tools
- Hangman Word Difficulty Rater
Distinct letter count is a simple declared complexity proxy for an ASCII Hangman word.
- Haiku Syllable Checker
A three-line 5–7–5 pattern can be checked when syllable counts have been independently annotated.