Glossary or Code Key¶

Reference artifact / controlled vocabulary — instantiates Context-Bounded Meaning Recovery

A fixed, shared key that pins each term, symbol, or code to an agreed meaning, so every reader of the same substrate resolves its signs the same way — and a machine can resolve them too.

When the same sign recurs across a substrate — a technical term, a status code, an icon, a coding label — interpreting it fresh each time invites drift, and different readers silently settle on different meanings. Glossary or Code Key pre-empts that by fixing the sign-to-meaning mappings once, in a shared reference that everyone applies uniformly. Its defining move is front-loading and standardization: rather than reconstruct meaning case by case, it commits a stable key up front, bridging a private or technical code into shared plain meaning — and, when the key is machine-readable, letting an algorithm resolve the same signs the same way people do. Where a context worksheet rebuilds situated meaning one artifact at a time, the glossary pre-commits a durable key that holds across every instance.

Example¶

A data team inherits a legacy incidents database whose status field holds bare codes 0 through 9 with no documentation. Analysts have each been quietly guessing — is 7 closed or escalated? — and quarterly reports that should agree don't. The team builds a code key: they interview the original maintainers, inspect which states transition into which, and fix each mapping — 7 = closed–duplicate, 3 = awaiting third party, and so on. Crucially, they publish it as a machine-readable data dictionary that both the reporting dashboards and an ETL job read from.

The outcome is that the same code now resolves to the same meaning everywhere — for a human reading a row and for the pipeline aggregating a million of them. The interpretation of the recurring sign has been made once, in the open, and reused, instead of being re-guessed on every desk.

How it works¶

The distinguishing move is to front-load the interpretation of recurring signs into a single authoritative key that people and machines apply identically. Case-by-case guessing is replaced by lookup; when a sign's meaning is contested, the key is the one place the decision is recorded and versioned, rather than being re-litigated each time. The bridge runs both ways: it takes a specialized or opaque code into shared meaning, and it hands a machine the explicit table it needs to interpret the same signs at scale.

Tuning parameters¶

Coverage versus precision — how many terms or codes the key fixes, and how tightly each is pinned; broad-and-loose or narrow-and-exact serve different substrates.
Bindingness — an advisory glossary readers may override versus an enforced controlled vocabulary that constrains what a sign is allowed to mean.
Sense granularity — one meaning per term versus sense-disambiguated entries for terms that legitimately carry several.
Machine-readability — a prose glossary for humans versus a structured, coded key an algorithm can apply directly.
Versioning — how changes to a sign's meaning over time are tracked, so old records are still read by the key that was in force when they were written.

When it helps, and when it misleads¶

Its strength is killing avoidable ambiguity at scale: it makes reading reproducible across people and automatable by machine, and it records a contested meaning once instead of endlessly.

Its failure mode is Procrustean — forcing genuinely ambiguous, contested, or evolving meaning into rigid boxes, and freezing a key that reality has since outgrown, so the artifact that was meant to aid interpretation starts to overwrite it.^[1] The discipline that guards against this is to version the key and to let it flag the terms where meaning is genuinely unsettled rather than papering over them — those belong in a standing ambiguity record (Ambiguity Register), not in a false-precise cell.

How it implements the components¶

translation_bridge — the key bridges the substrate's private or technical code into shared, plain meaning that any reader can apply.
machine_interpretation_assist — a machine-readable key is exactly what lets an algorithm resolve the same signs automatically, extending one act of interpretation across a whole corpus.

It fixes the *conventional meaning of recurring signs; it does not reconstruct the one-off situated meaning of a particular utterance (Context Reconstruction Worksheet), read the formal marks of the substrate (Close Reading Table), or preserve an irreducible ambiguity as a finding (Ambiguity Register).*

Instantiates: Context-Bounded Meaning Recovery — supplies the shared key that keeps recurring signs resolving consistently.
Sibling mechanisms: Context Reconstruction Worksheet · Close Reading Table · Evidence-to-Claim Matrix · Alternative Readings Review · Framework Selection Memo · Hermeneutic Loop Log · Ambiguity Register · Interpretation Brief · Interpretation Red Team · Pragmatic Force Walkthrough · Precedent Comparison Table · Stakeholder Meaning Check · Translation Backcheck

Notes¶

A code key answers "what does this sign conventionally mean," not "what did this author mean here." For a specific utterance whose meaning turns on its situation, the key is only a starting point and situated reconstruction takes over — which is why Context Reconstruction Worksheet handles the one-off case while the glossary handles the recurring one.

References¶

[1] From the myth of Procrustes, who stretched or cut guests to fit his bed — a Procrustean standard forces the material to fit the mold. A frozen or over-tight code key does this to meaning; versioning and explicit flags for contested terms are the guard. ↩