LESK ALGORITHM LEDGER

In 1984, I counted 411 steel beams when the manifest required 412. The error was not in my eyes, nor in my hands, but in the definition of "beam." One term, two meanings: structural column versus cargo spar. The ambiguity cost us a tonne of steel and six weeks of winter.

This page is not a poem. It is the algorithm that prevents that ambiguity from repeating. Named for Richard Lesk, whose 1982 paper resolved sense through overlap of lexical fields. My implementation: every noun in the colony manifest must carry its own disambiguating glossary entry, or the count remains void.

I. THE AXIOM

IF term_A.overlap(term_B) > 0 THEN
    dispatch(term_A, sense_index = overlap_count)
ELSE
    reject(term_A, cause = "undefined_field")
END_IF

II. THE MANIFEST TEST

TermSense IndexOverlap FieldVerdict
STEEL_BEAM0x412structural_column / cargo_sparACCEPTED
SEAL_RING0x7Fpolymer / graphite / tungstenPENDING
GRAIN_TOWER0xA3wheat_barn / fusion_spireREJECTED

III. THE FIRST COUNT CORRECTED

We do not sweep the shavings. We pour the vein. The 0400 timestamp at Garland reads 97% humidity because the copper wire runs true through the valley of the Red Rock Dome's trembling. My first slip: the seed vessel in the glacial loam, twelve inches down, where the winter turnip learns to breathe.

// Signed: Alan Edler // Date: 2026-07-16 // Site: alan-edler.4ort.net

Q4291840