Skip to content

Main content

Random Edit Script Reconstruction Challenge Generator

Generate and replay bounded Unicode code-point edit attempts with explicit empty-text no-op controls, retaining the target and a separately delegated minimum edit distance; the planted script need not be minimum.

Loading tool…

Description

Generate and replay bounded Unicode code-point edit attempts with explicit empty-text no-op controls, retaining the target and a separately delegated minimum edit distance; the planted script need not be minimum.

A parser corpus pairs literal input spellings or structured documents with observable parser results or explicitly constructed expectations. Successful parsing, semantic validity, and exact round-trip preservation are separate properties, so test records retain the relevant evidence.

Generate and replay bounded Unicode code-point edit attempts with explicit empty-text no-op controls, retaining the target and a separately delegated minimum edit distance; the planted script need not be minimum.

When to use this tool

Use this generator to create reproducible edit script reconstruction challenge cases from the supplied model or bank. Inspect the returned evidence before using cases in a test or exercise.

How to use the tool and how it works

  1. Supply source, alphabet, operations, editCount in the field shapes below. Set seed when you need an explicit replay.
  2. Run the tool and correct any input error. For generated controls, distinguish a successful fixture containing an invalid case from failure to generate the fixture.
  3. Read source, target, edits, minimumDistance. Use the conventions below. Keep answer-bearing fields separate when presenting an exercise.

Represent the source as Unicode code points and apply sampled insert, delete, or replace edits at current code-point indexes. Record before/after values and applied flags, return the final target, and delegate the minimum Levenshtein distance.1

Delegated operations used for this result: levenshtein. Their calculation or parsing conventions apply to the corresponding result fields.2

Input fieldMeaning and unitsAccepted input
sourceSourceRequired. Text; maximum UTF-16 length 64.
alphabetAlphabetRequired. Array of Text; minimum UTF-16 length 1; maximum UTF-16 length 2.; minimum items 1; maximum items 8.
operationsOperationsRequired. Array of Text; one of "insert", "delete", "substitute".; minimum items 1; maximum items 3.
editCountEdit CountRequired. Safe integer; minimum 1; maximum 8.
seedOptional numeric seed; takes precedence over context randomness. Without either, use the fixed tool.io default seed.Optional. Safe integer.
Output fieldInterpretationReturned shape
sourceSourceRequired. Text; maximum UTF-16 length 64.
targetTargetRequired. Text; maximum UTF-16 length 80.
editsEditsRequired. Array of Object; no unknown keys.; minimum items 0; maximum items 8.
edits[].kindKindRequired. Text; one of "insert", "delete", "substitute".
edits[].indexIndexRequired. Safe integer; minimum 0; maximum 40.
edits[].beforeBeforeRequired. Text; maximum UTF-16 length 2.
edits[].afterAfterRequired. Text; maximum UTF-16 length 2.
edits[].appliedAppliedRequired. Boolean.
minimumDistanceMinimum DistanceRequired. Safe integer; minimum 0; maximum 40.
randomnessReplay source and normalized 32-bit seed, or null seed for an advancing context source.Required. Object; no unknown keys.
randomness.seedOptional safe-integer replay seed; normalization and precedence are explained below.Required. Safe integer. or Null.
randomness.sourceSourceRequired. Text; one of "context", "seed".

An explicit safe-integer seed takes precedence over injected context randomness and is normalized to an unsigned 32-bit integer. With no seed and no context source, replay uses the fixed tool.io default seed. A context source must return finite values from zero inclusive to one exclusive; its advancing state must be retained separately. randomness records the source and normalized seed, or null for context. These generators are not cryptographic random sources.

json
{
  "input": {
    "source": "cat",
    "alphabet": [
      "o",
      "s"
    ],
    "operations": [
      "insert",
      "delete",
      "substitute"
    ],
    "editCount": 2,
    "seed": 42
  },
  "output": {
    "source": "cat",
    "target": "co",
    "edits": [
      {
        "kind": "delete",
        "index": 1,
        "before": "a",
        "after": "",
        "applied": true
      },
      {
        "kind": "substitute",
        "index": 1,
        "before": "t",
        "after": "o",
        "applied": true
      }
    ],
    "minimumDistance": 2,
    "randomness": {
      "seed": 42,
      "source": "seed"
    }
  }
}

Limitations and assumptions

  • A noninsert edit on empty text is recorded unapplied; replacement can leave a character unchanged. The generated script is not necessarily a shortest script, and edit count need not equal minimumDistance.
  • A replay requires the same complete input and implementation. The stated sampling convention applies within its eligible space. A finite draw does not exhaust all possible outputs; repeats remain possible unless a distinct-selection rule is explicit.
  • The field tables state structural bounds; cross-field constraints and bounded search or output budgets also apply. Unknown keys are rejected where the object contract disallows them. Input errors are distinct from null fields and deliberate invalid controls in a successful output.

Alternative or Complementary methods

For a supplied example, inspect the returned construction or delegated check directly. To evaluate a consumer, also test cases chosen for its own boundaries; a generated finite corpus does not establish exhaustive coverage.

References

  1. Tool behavior and example: Random Edit Script Reconstruction Challenge Generator — tool.io

  2. Calculation or validation: distance/levenshtein — tool.io

Similar or alternative tools

  • Sequential Pattern Mining Tool

    Mine bounded frequent ordered subsequences of single-event string sequences using prefix projection, allowing arbitrary gaps and repeated events and counting each source sequence at most once per pattern.

  • Random Configuration Override Chain Fixture Generator

    Permute supplied flat configuration layers and retain first- or last-wins results, explicit null deletion and per-key winning-layer provenance.