Token Affix Count Table

Count literal affix matches in explicitly supplied tokens; case-sensitive and overlapping affixes are counted independently.

Description

Count literal affix matches in explicitly supplied tokens; case-sensitive and overlapping affixes are counted independently.

Affix counts show how many supplied tokens begin or end with selected literals. Each requested affix keeps its own count, which supports overlapping prefix or suffix families.

When to use this tool

Count literal affix matches in explicitly supplied tokens; case-sensitive and overlapping affixes are counted independently.

Prepare the supplied tokens, prefixes, suffixes fields for this operation.
Compare the complete example with the representation used by your own input before carrying the result into another step.

How to use the tool and how it works

Enter tokens, prefixes, suffixes. Use the exact text syntax, units and index conventions explained below.
Run the tool. If input validation fails, correct the supplied fields before interpreting any result.
Read result.prefixCounts, result.suffixCounts. Interpret false, null and empty lists using the distinctions below; they can be valid outputs.

For every prefix, count tokens passing case-sensitive startsWith; for every suffix, count tokens passing endsWith. Preserve the respective affix-list orders.^[1]

Input field	Meaning and representation	Accepted input
tokens	tokens.	At most 128 strings, each at most 128 UTF-16 code units
prefixes	prefixes.	At most 128 strings, each at most 128 UTF-16 code units
suffixes	suffixes.	At most 128 strings, each at most 128 UTF-16 code units

Output field	Interpretation
result	Object containing the named outputs below.
result.prefixCounts	The prefix counts list in the ordering and representation described above.
result.suffixCounts	The suffix counts list in the ordering and representation described above.

json

{
  "input": {
    "tokens": [
      "ab",
      "ac",
      "bc"
    ],
    "prefixes": [
      "a"
    ],
    "suffixes": [
      "c"
    ]
  },
  "output": {
    "result": {
      "prefixCounts": [
        2
      ],
      "suffixCounts": [
        2
      ]
    }
  }
}

Limitations and assumptions

A token may count for several affixes, and duplicates in the token list count repeatedly. Empty affixes match every token; no stemming, regex or normalization is applied.
Text offsets and lengths use UTF-16 code units unless explicitly described as bytes or code points. CRLF, CR and LF are recognized as line endings; a terminal newline creates a final empty line in the shared line model.
Every declared top-level field is required and unexpected fields are rejected. Numeric inputs must be finite; ordinary text fields are bounded to 8,192 UTF-16 code units, with tighter operation-specific limits where stated.
Ordinary string lists have at most 128 entries of at most 128 code units each; numeric lists and matrices have separate bounded size checks. Nonfinite results and excessively large serialized outputs are rejected.
Indexes are zero-based and spans have an exclusive end unless explicitly stated otherwise. A valid false, null or empty-list result is distinct from malformed input.

Alternative or Complementary methods

Use a parser or language-aware editor when quoting, syntax or nested constructs matter. For plain text transforms, keep UTF-16 offsets, Unicode code points, grapheme clusters and UTF-8 byte offsets distinct; apply changes to the same source version used to calculate spans.

References

Tool behavior and example: Token Affix Count Table — tool.io

Similar or alternative tools

Literal Token Spacing Audit
Audit ASCII-space runs around every overlapping literal token; document edges pass, tabs are not counted as spaces.
Whole Token Literal Replacer
Replace whole tokens under an explicit ASCII letter/digit/underscore boundary rule; Unicode word segmentation is not inferred.