Diacope Interrupted Repetition Distance Checker
Enumerate exact interrupted-token repetitions, retaining all nonadjacent pairs and actual intervening token counts, not infer diacope intent.
Description
Diacope involves repetition separated by intervening material.
Diacope involves repetition separated by intervening material.1
Enumerating exact token pairs exposes lexical distances without establishing a deliberate rhetorical device.
When to use Diacope Interrupted Repetition Distance 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 Diacope Interrupted Repetition Distance 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 |
Enter 1–64 nonblank exact tokens. For every pair with equal strings and second index at least two after the first, return zero-based [first,second] and the number of intervening tokens. All qualifying pairs are retained, even within a longer repeated sequence.
gap=b−a−1 for a<b−1 and token_a=token_b 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.repeatedTokenPairs | All qualifying zero-based nonadjacent equal-token index pairs | list |
| result.interveningTokenCounts | Number of tokens strictly between each returned pair | list |
{
"input": {
"lexicalTokens": [
"go",
"now",
"go",
"home",
"go"
]
},
"output": {
"result": {
"repeatedTokenPairs": [
[
0,
2
],
[
0,
4
],
[
2,
4
]
],
"interveningTokenCounts": [
1,
3,
1
]
}
}
}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 Epizeuxis Triple Immediate Repetition Checker: Triple immediate repetition can be counted as a maximal run of the same lexical token. The observed run length describes form while leaving intention and emphasis to interpretation.
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.
- Epizeuxis Triple Immediate Repetition Checker
Triple immediate repetition can be counted as a maximal run of the same lexical token. The observed run length describes form while leaving intention and emphasis to interpretation.