Random Edit Distance Mutation Exercise Generator
Build a bounded reproducible edit distance mutation exercise from explicitly supplied candidate scenarios. Every candidate must satisfy imported text/edit-distance before selection; answer cards preserve its units, conventions, domain limitations and signed/unknown results. Draws are uniform over caller candidate positions; no replacement means no repeated positions, not necessarily distinct answers. No automatic pedagogical correctness, compliance or physical readiness.
Description
Levenshtein distance measures the minimum single-character insertions, deletions, and substitutions between strings.
Levenshtein distance measures the minimum single-character insertions, deletions, and substitutions between strings.1
These exercises compare supplied texts by Unicode code points without generating mutations automatically.
When to use Random Edit Distance Mutation Exercise Generator
Use this tool when you need to assemble reproducible practice cards from a supplied, validated scenario corpus. Prepare a reproducible seed and the inventory, corpus, or experiment parameters stated below.
How to use Random Edit Distance Mutation Exercise Generator and understand its results
- Prepare a reproducible seed and the inventory, corpus, or experiment parameters stated below.
- Enter seed, count, withoutReplacement, candidateInputsJson, following the field table and calculation rules below, then run the tool.
- Read result. For result objects, inspect the nested output fields below, including any missing evidence or selected indices.
- 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 |
|---|---|---|---|
| seed | Required nonblank deterministic seed; the SDK can replace the source with context.random. | string | Required |
| count | Number of draws, cards, trials, or output entries under the tool-specific rule; safe integer 1–64 with any narrower inventory bound. | number | Required |
| withoutReplacement | True removes selected inventory positions; false permits repeated positions. Equal rendered values or answers can still occur. | boolean | Required |
| candidateInputsJson | Dense list of JSON objects serialized as strings for the imported calculator; every candidate must be valid. | list of string | Required |
Enter 1–128 dense candidateInputsJson strings, each a strict JSON object for the imported calculator. Each string is at most 8192 UTF-16 units, the corpus at most 131072, and nesting at most 16 levels; nonfinite numbers and prototype-control keys are rejected. Select candidate positions under the sampling rules, then validate every candidate, including undrawn ones, by invoking the imported calculator with a fixed random source of 0.5. Any invalid candidate fails the whole request. Invoke it again for selected candidates with the request’s advancing source, and return original inputs, actual answer objects, selected indices, and never-selected indices. Duplicate candidate texts or equal answers may occur at distinct positions.2, 3, 4
Use a nonblank seed of at most 256 UTF-16 units and a safe-integer count from 1 to 64, subject to the tool’s narrower inventory bound. By default the seed is hashed into a deterministic pseudorandom state; each run restarts that state, so identical full inputs and implementation reproduce the result. The SDK may provide context.random, which replaces the seeded source and advances across the request; the seed remains required. Every source value must be finite in [0,1), with a request limit of 100000 source calls. Draw an index as floor(U×remainingSize). For indexed inventory draws, with replacement draw from the full inventory each time; without replacement remove each chosen position from an ordered pool and reject counts exceeding the inventory size. Uniform-source draws are over positions, not necessarily distinct values. This is not secure randomness.
The imported dynamic program maintains one previous and one current row, taking the minimum of insertion, deletion, and substitution costs with unit cost. Equal code points cost zero; case and normalization remain significant. Empty strings are permitted.
D(i,j)=min(D(i−1,j)+1,D(i,j−1)+1,D(i−1,j−1)+[a_i≠b_j]) Read these symbols with the field meanings and branch or reference rules above.
| Output field | Meaning | Value type |
|---|---|---|
| result | Composite output; read its nested fields and the worked example. | object |
| result.baseToolId | Canonical identifier of the imported answer calculator. | string |
| result.selectedCandidateIndices | Zero-based positions in the original candidate corpus, in draw order. | list |
| result.unusedCandidateIndices | Original candidate positions never selected during this request. | list |
| result.exercises | Selected supplied input objects paired with their actual imported answer objects and any stated additional outputs. | list |
Each result.exercises entry preserves its supplied input and imported answer object. Additional roundTripAnswer, secondaryAnswer, prompts, or derived quantities appear only where the mechanics above describe them. selectedCandidateIndices and unusedCandidateIndices refer to the original corpus positions, not answer values.
{
"input": {
"seed": "tool.io/batch42",
"count": 1,
"withoutReplacement": true,
"candidateInputsJson": [
"{\"a\": \"kitten\", \"b\": \"sitting\"}"
]
},
"output": {
"result": {
"baseToolId": "text/edit-distance",
"selectedCandidateIndices": [
0
],
"unusedCandidateIndices": [],
"exercises": [
{
"input": {
"a": "kitten",
"b": "sitting"
},
"answer": {
"distance": 3
}
}
]
}
}
}Limitations and assumptions
The default source is deterministic pseudorandomness, not an independently audited or secure draw. Replacement applies to inventory positions; distinct positions may render identically or yield equal answers. A fixture does not independently verify the supplied answers or reference content. Each answer retains the imported calculator’s unit conventions and domain assumptions. Randomizing a supplied scenario does not broaden that calculator’s capabilities.
Missing required fields, unknown fields, wrong types, and violated calculation rules return input issues. Numeric values must be finite; nonfinite numeric outputs are rejected. Arrays must be dense, with no missing cells. Extremely large composite outputs are rejected.
Alternative or Complementary methods
For a related task, use Random Hamming Distance Exercise Generator: Hamming distance counts positions that differ between equal-length sequences. These exercises compare supplied strings by Unicode code points, which may differ from visible glyph or grapheme counts. For a complementary step, use Random Common Subsequence Exercise Generator: A common subsequence preserves character order but does not require adjacent characters. These exercises return one longest shared subsequence of two supplied strings, with a deterministic choice among tied solutions.
References
Similar or alternative tools
- Random Hamming Distance Exercise Generator
Hamming distance counts positions that differ between equal-length sequences. These exercises compare supplied strings by Unicode code points, which may differ from visible glyph or grapheme counts.
- Random Common Subsequence Exercise Generator
A common subsequence preserves character order but does not require adjacent characters. These exercises return one longest shared subsequence of two supplied strings, with a deterministic choice among tied solutions.