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

Overlap — where it appears

A phrase whose source region extends into the phrase itself. It is what makes a self-referential parse compact on runs, and it is the reason a depth histogram’s deepest positions can be punctuation rather than text that was copied through generations.

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

1,00010⁴10⁵10⁶charactersoperationscharacter comparisonstransitions and linksrepetitive · 8 copies346 phrases at 8,192

The parse in one pass of the text

The same parse, phrase for phrase, from 1,324,336 character comparisons or from 25,420 transitions and suffix-link steps. One of those numbers grows with the text and the other grows with its square, and the difference is why every measurement about a depth cap here was taken on a few thousand characters.

text · Parse 73 characters long24 runsto depth 7270 characters long24 runsto depth 69longest: 73 × "-" at position 11,0162,685 positions below depth 20, 2,685 of them inside a runeight source modules · worst depth 78100.0% in runs

The deepest text is punctuation

Eight source files reach depth 78 in a parse, on a collection with no version history in it at all. The positions between depth 20 and depth 72 are the same 48 characters at every level, and every one of them is a dash in a comment separator.

wrong · Parse

Named alongside it

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

ParseAmortisedCapConstructionCopyCorpusDefinitionDepthExtractionHistogramLempel zivLinear time

All concepts