Epizeuxis Triple Immediate Repetition Checker
Count maximal immediate identical-token runs of at least3tokens, not inferred rhetorical intention; exact case/punctuation tokens.
Description
Triple immediate repetition can be counted as a maximal run of the same lexical token.
Triple immediate repetition can be counted as a maximal run of the same lexical token.1
The observed run length describes form while leaving intention and emphasis to interpretation.
When to use Epizeuxis Triple Immediate Repetition Checker
Use this tool when you need to review the specific lexical, time-budget, or annotation operation described below. Establish the language, clause boundaries, transcription basis, source context, or evidence annotations required by this particular tool.
How to use Epizeuxis Triple Immediate Repetition Checker and understand its results
- Establish the language, clause boundaries, transcription basis, source context, or evidence annotations required by this particular tool.
- Enter lexicalTokens, following the field table and calculation rules below, then run the tool.
- Read result. Inspect the nested fields in the output table below and keep any missing evidence or selected indices visible.
- Correct any input issues and run again. Before using a successful result, review its units, signs, evidence coverage, and stated model or reference assumptions.
| Input field | Meaning | Value type | Requirement |
|---|---|---|---|
| lexicalTokens | Lexical tokens | list of string | Required |
Supply a nonempty list of nonblank exact lexical tokens. Group consecutive identical strings and return starts and full lengths of maximal runs of at least three tokens. A run of four returns one length-four record rather than overlapping triples.
run qualifies when runLength≥3 Read these symbols with the field meanings and branch or reference rules above.
| Output field | Meaning | Value type |
|---|---|---|
| result | Object containing the fields below | object |
| result.repeatedRunStartIndices | Zero-based starts of qualifying maximal identical-token runs | list |
| result.repeatedRunLengths | Full lengths of those maximal runs in the same order | list |
{
"input": {
"lexicalTokens": [
"go",
"go",
"go",
"now"
]
},
"output": {
"result": {
"repeatedRunStartIndices": [
0
],
"repeatedRunLengths": [
3
]
}
}
}Limitations and assumptions
Clause boundaries, transcriptions, role labels, and contextual judgments are supplied evidence. The result describes this exact lexical or annotation operation, not inferred intent, historical origin, persuasive effect, or argument soundness.
Missing required fields, unknown fields, wrong types, and violated calculation rules return input issues. Arrays must be dense, with no missing cells. Ordinary string lists allow at most 128 strings of at most 128 UTF-16 units each. Extremely large composite outputs are rejected.
Alternative or Complementary methods
For a related task, use Palilogia Exact Word Immediate Repeat Checker: Immediate lexical repetition can be described through maximal runs of the same token. Counting those runs measures form while leaving rhetorical intention to contextual interpretation. For a complementary step, use Diacope Interrupted Repetition Distance Checker: Diacope involves repetition separated by intervening material. Enumerating exact token pairs exposes lexical distances without establishing a deliberate rhetorical device.
References
Similar or alternative tools
- Palilogia Exact Word Immediate Repeat Checker
Immediate lexical repetition can be described through maximal runs of the same token. Counting those runs measures form while leaving rhetorical intention to contextual interpretation.
- Diacope Interrupted Repetition Distance Checker
Diacope involves repetition separated by intervening material. Enumerating exact token pairs exposes lexical distances without establishing a deliberate rhetorical device.