Generator

LZSS: bits per symbol against the window it may look back over

Rendered here at the parameters it defaults to, with every essay that calls it — which is the same list as the blast radius of changing it.
LZSS: bits per symbol against the window it may look back overNo probability appears anywhere in this coder. Its only model is a window of recent text and its only move is to say "the next 9.6 symbols are the ones that appeared d positions ago". Widening the window from 16 to 16,384 takes it from 7.83 bits per symbol to 2.13, through the zeroth-order floor of 3.89 — which it is entitled to do, because that floor belongs to a different model.H₀ = 3.8916642561k4k16kwindow, in symbolsbits per symbol0.04.38.6LZSSmean symbols covered per match4.65.15.76.98.79.6model: a window of recent text, no probabilities2.13 bits/symbol at a window of 16,384

LZSS: bits per symbol against the window it may look back over

No probability appears anywhere in this coder. Its only model is a window of recent text and its only move is to say "the next 9.6 symbols are the ones that appeared d positions ago". Widening the window from 16 to 16,384 takes it from 7.83 bits per symbol to 2.13, through the zeroth-order floor of 3.89 — which it is entitled to do, because that floor belongs to a different model.

Drawn at 700 × 470, wide on the page. Everything above is what dictionary-growth returns with no arguments; the caption is the generator's own, computed from the numbers in the drawing rather than written beside it.

1 essay calls dictionary-growth. The drawing above is what it returns with no arguments at all; every call below passes it something, because a placement that passes nothing draws whichever member of the family the generator happens to default to rather than the one its essay argues about — which is what optcheck and figfill exist to catch.

Where it is called

Changing this generator changes every one of these figures.

The library, page 2 of 5 — where dictionary-growth sits