Algorithms & Data Structures
the bound is a claim, and it is checkable
Concept

Validity — where it appears

Whether a method finds everything it claims to. For a search scheme it is a covering condition over the ways the errors can fall, and a scheme that fails it returns real matches at real positions with correct error counts and silently omits others.

Named by 2 essays across 2 fields — each of them below, with the objects they name alongside it.

100100occurrences of the patternreadsmost frequent ", and " · 388 occurrencesthe scanthe chain12 documents · 144,617 characters3 of 6 won

What the generated collection was right about

Five strands of conclusions, drawn on collections made by one line with one dial, checked against a corpus nobody made. Most hold. One headline was a property of the generator's alphabet, and one crossing that was guessed at turns out to be met — but only with the structure the strand on range minima built.

practice · Document 11010⁴cap on the depthphrasesno capcap 165,536 characters · 16 copies26x at cap 1

What a quadratic construction was setting

A depth cap of one costs 90% of an 8,192-character text in phrases, and 86% of a 65,536-character one. The ladder's conclusions hold at thirty-two times the size — and the number the ladder could not reach, the deepest chain a real collection produces, turns out to be fourteen.

wrong · Parse

Named alongside it

The objects these essays reach for when they reach for this one.

MeasurementConstructionControlCorpusCrossoverDepth capDocument listingExtractionGenerated collectionIndex sizeLempel zivModel

All concepts