Letter Frequency Rank By Language Lookup Table
Rank actual corpus letters under caller single-letter alphabet with competition ties and unlisted evidence retained; not an embedded language frequency table, digraph segmentation or transliteration.
Description
Letter-frequency ranks describe the supplied corpus and alphabet.
Letter-frequency ranks describe the supplied corpus and alphabet. Ties use competition rank rather than an arbitrary alphabet order.1
Enter text and nonempty alphabet of distinct single Unicode letters after NFC/lowercase. Count normalized letters, retain unlisted-letter count and return counts, ranks and listed total.
When to use Letter Frequency Rank By Language Lookup Table
Use Letter Frequency Rank By Language Lookup Table when you need to evaluate the supplied records under the calculation and evidence rules below. No language frequency table, digraph tokenization or transliteration is supplied. Zero-count letters may tie.
Prepare explicit text tokens, annotated language observations, caller mappings or a supported locale as requested. Preserve source evidence and the stated Unicode counting convention.
How to use Letter Frequency Rank By Language Lookup Table and understand its results
- Prepare explicit text tokens, annotated language observations, caller mappings or a supported locale as requested. Preserve source evidence and the stated Unicode counting convention.
- Enter observedText, callerAlphabetLetters using the field table and calculation rules, then run the tool.
- Read alphabetLetterCounts, competitionFrequencyRanks, countedAlphabetLetters, unlistedLetterCount. The explanation below defines the units, signs, ordering and any flags or placeholder values.
- If the tool reports an input issue, correct the values and run it again. Apply the stated assumptions when interpreting a successfully returned result.
| Input field | Meaning | Value type; see rules below | Requirement |
|---|---|---|---|
| observedText | Observed text | string | Required |
| callerAlphabetLetters | Caller alphabet letters | list of string | Required |
Enter text and nonempty alphabet of distinct single Unicode letters after NFC/lowercase. Count normalized letters, retain unlisted-letter count and return counts, ranks and listed total.
rank=1+number of alphabet entries with a strictly greater count Units, indexing, boundary conditions and exceptional cases are defined in the calculation rules above.
| Output field | Meaning | Value type |
|---|---|---|
| alphabetLetterCounts | Alphabet letter counts | list of number |
| competitionFrequencyRanks | Competition frequency ranks | list of number |
| countedAlphabetLetters | Counted alphabet letters | number |
| unlistedLetterCount | Unlisted letter count | number |
{
"input": {
"observedText": "Aa b",
"callerAlphabetLetters": [
"a",
"b",
"c"
]
},
"output": {
"alphabetLetterCounts": [
2,
1,
0
],
"competitionFrequencyRanks": [
1,
2,
3
],
"countedAlphabetLetters": 3,
"unlistedLetterCount": 0
}
}Limitations and assumptions
No language frequency table, digraph tokenization or transliteration is supplied. Zero-count letters may tie.
Numeric inputs, where present, must be finite. Follow the calculation-specific rules for overflow, underflow and exceptional cases. Numeric lists are limited to 10,000 entries; string lists to 128 strings of at most 128 characters each. The rules above may impose smaller limits. Extremely large text inputs are rejected. Missing required fields, extra fields, wrong value types and violations of the calculation rules are input errors.
Alternative or Complementary methods
Use Stopword-Based Language Guess Score: Stopword overlap supplies lexical evidence for caller-defined profiles. Shared words can produce ties and zero matches can mean no evidence. For a complementary task, use Arabic Three-Letter Root Share: Root-length shares describe an already identified Arabic-root sample. Counting letters is separate from extracting roots from words.
References
Similar or alternative tools
- Stopword-Based Language Guess Score
Stopword overlap supplies lexical evidence for caller-defined profiles. Shared words can produce ties and zero matches can mean no evidence.
- Arabic Three-Letter Root Share
Root-length shares describe an already identified Arabic-root sample. Counting letters is separate from extracting roots from words.