Description
Sample caller-supplied passages with replacement, draw a deletion interval and valid starting ordinal for each, and delegate punctuation-preserving cloze generation with original-word keys. Tokenization follows the existing Unicode word rule; empty-key exercises can occur when the first ordinal exceeds passage length, and difficulty is not calibrated.
A workflow or scheduling fixture makes ordering, dependencies, capacity, and timing explicit. Returning both the constructed records and their checks helps consumers distinguish a valid arrangement from a simulated failure case.
Sample caller-supplied passages with replacement, draw a deletion interval and valid starting ordinal for each, and delegate punctuation-preserving cloze generation with original-word keys. Tokenization follows the existing Unicode word rule; empty-key exercises can occur when the first ordinal exceeds passage length, and difficulty is not calibrated.
When to use this tool
Use this generator to create reproducible cloze practice packet 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
- Supply passages, minimumInterval, maximumInterval, count in the field shapes below. Set seed when you need an explicit replay.
- 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.
- Read exercises. Use the conventions below. Keep answer-bearing fields separate when presenting an exercise.
Preflight supplied passages with the existing cloze calculator, then sample a passage, deletion interval, and first-deletion ordinal. Delegate the exercise and retain passage identity, selected settings, and answer-bearing output.1
Delegated operations used for this result: cloze passage generator. Their calculation or parsing conventions apply to the corresponding result fields.2
| Input field | Meaning and units | Accepted input |
|---|---|---|
| passages | Passages | Required. Array of Text; minimum UTF-16 length 1; maximum UTF-16 length 4096.; minimum items 1; maximum items 32. |
| minimumInterval | Minimum Interval | Required. Safe integer; minimum 1; maximum 128. |
| maximumInterval | Maximum Interval | Required. Safe integer; minimum 1; maximum 128. |
| count | Count | Required. Safe integer; minimum 1; maximum 32. |
| seed | Optional numeric seed; takes precedence over context randomness. Without either, use the fixed tool.io default seed. | Optional. Safe integer. |
| Output field | Interpretation | Returned shape |
|---|---|---|
| exercises | Exercises | Required. Array of Object; no unknown keys.; minimum items 1; maximum items 32. |
| exercises[].passageIndex | Passage Index | Required. Safe integer; minimum 0; maximum 31. |
| exercises[].passage | Passage | Required. Text; minimum UTF-16 length 1; maximum UTF-16 length 4096. |
| exercises[].deleteEveryNthWord | Delete Every Nth Word | Required. Safe integer; minimum 1; maximum 128. |
| exercises[].firstDeletionOrdinal | First Deletion Ordinal | Required. Safe integer; minimum 1; maximum 128. |
| exercises[].clozePassage | Cloze Passage | Required. Text; maximum UTF-16 length 16384. |
| exercises[].deletedWords | Deleted Words | Required. Array of Text; minimum UTF-16 length 1; maximum UTF-16 length 4096.; maximum items 4096. |
| randomness | Replay source and normalized 32-bit seed, or null seed for an advancing context source. | Required. Object; no unknown keys. |
| randomness.seed | Optional safe-integer replay seed; normalization and precedence are explained below. | Required. Safe integer. or Null. |
| randomness.source | Source | Required. 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.
{
"input": {
"passages": [
"One two three four five six.",
"Red, blue; green and gold."
],
"minimumInterval": 2,
"maximumInterval": 4,
"count": 3,
"seed": 42
},
"output": {
"exercises": [
{
"passageIndex": 1,
"passage": "Red, blue; green and gold.",
"deleteEveryNthWord": 3,
"firstDeletionOrdinal": 3,
"clozePassage": "Red, blue; ____ and gold.",
"deletedWords": [
"green"
]
},
{
"passageIndex": 1,
"passage": "Red, blue; green and gold.",
"deleteEveryNthWord": 2,
"firstDeletionOrdinal": 2,
"clozePassage": "Red, ____; green ____ gold.",
"deletedWords": [
"blue",
"and"
]
},
{
"passageIndex": 0,
"passage": "One two three four five six.",
"deleteEveryNthWord": 3,
"firstDeletionOrdinal": 3,
"clozePassage": "One two ____ four five ____.",
"deletedWords": [
"three",
"six"
]
}
],
"randomness": {
"seed": 42,
"source": "seed"
}
}
} Limitations and assumptions
- Tokenization and deletion markers follow the linked calculator. A large interval or first ordinal can yield few omissions; the generator does not assess passage difficulty, pedagogical value, or supplied factual accuracy.
- 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
Similar or alternative tools
- Random Faded Solution Practice Packet Generator
Sample supplied problems with replacement and delegate each selected problem's worked-example fade schedule at its packet position. Return visible prefixes, hidden suffixes and complete caller-authored step keys, including repeated problems and zero-step independent exercises; app presentation and pedagogical validity are separate.
- Calendar Overlap and Common Gap Finder
Compare bounded supplied busy calendars over an explicit half-open epoch-millisecond window, deduplicating same-calendar overlap and delegating interval cells to report common gaps, overlaps and per-calendar occupied duration.