Hangman Word Difficulty Rater
DeclaredhangmanDISTINCT-letter-countcomplexityproxy,not wordfrequency/actualhumanpuzzledifficulty.
Description
Distinct letter count is a simple declared complexity proxy for an ASCII Hangman word.
Distinct letter count is a simple declared complexity proxy for an ASCII Hangman word.1
Actual puzzle difficulty also depends on vocabulary and the players' guessing context.
When to use Hangman Word Difficulty Rater
Use this tool to apply the stated hangman word difficulty rater operation with an explicit input and unit basis.
How to use Hangman Word Difficulty Rater and how it works
- Establish the text or game convention described above.
- Enter actualAsciiWord and run the tool.
- Read result.value 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 |
|---|---|---|---|
| actualAsciiWord | Ascii word, on the basis specified in the algorithm. | string | required; further conditions in the algorithm |
Require a nonblank ASCII-letter word. Lowercase it, count distinct letters and return the count; repeated letters contribute once.
proxy = count(distinct lowercase letters) Apply the declared units, ordering and branch conditions.
| Output field | Meaning | Value type |
|---|---|---|
| result | Object containing the declared output fields. | object |
| result.value | Distinct lowercase ASCII letter count used as the declared proxy. | number |
{
"input": {
"actualAsciiWord": "apple"
},
"output": {
"result": {
"value": 4
}
}
}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 Wordle Starting Word Advisor. A Wordle starter heuristic can favor words containing high-weight distinct letters.
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
-
Hangman Word Difficulty Rater — tool.io
Similar or alternative tools
- Wordle Starting Word Advisor
A Wordle starter heuristic can favor words containing high-weight distinct letters.
- Haiku Syllable Checker
A three-line 5–7–5 pattern can be checked when syllable counts have been independently annotated.