The frontier a ceiling on the chain traces out

The frontier a ceiling on the chain traces out

Each point is one cap, on a collection of 16 copies of 512 characters of English-like. Left is a cheap character and up is a large structure, so the curve runs from the cap of one — depth 1 everywhere, 514,570 bits, a phrase count 47x the unbounded parse's — to no cap at all, at 8,580 bits and a worst chain of 22. Nothing on this curve dominates anything else on it, which is what makes it a frontier and not a ranking. Both axes are logarithmic.

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

6 essays call capped-parse. 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.