Declared Equivalence Mapping¶

An explicit, authoritative, versioned assertion that two concepts from different vocabularies are interchangeable for stated purposes — collapsing a cross-scheme distinction to zero for consumers who trust the declaration rather than re-verifying at use-time.

Version: v4 · 2026-09-28 · History · 3 corrections
Domain-specific #: 247
Domain group: Humanities
Origin domain: Linguistics & Semiotics
Subdomain: Knowledge Organization and Interoperability → Linguistics & Semiotics

Core Idea¶

A declared equivalence mapping is an explicit, authoritative assertion that two concepts from different controlled vocabularies are interchangeable for stated purposes — the canonical instance being SKOS exactMatch. It is declared (a versioned artifact, not inferred), symmetric, and purpose-bounded (substitutability within a defined context, not ontological identity). Any system respecting it treats the two identifiers as a single atom. Authority is load-bearing: the substitution is valid by the declarer's judgment, making the mapping a governed artifact with an author, purpose, version, and retraction channel.

How would you explain it like I'm…

The Same-Word Note

Two libraries use different words for the same thing, like one says 'kitty' and the other says 'cat.' A trusted grown-up writes an official note: 'For finding books, these two words mean the same.' Now everyone's computers treat them as one word. If the grown-up later finds a mistake, they can fix the note or take it back.

Official Same-Meaning Labels

Different organizations often use their own lists of names or codes for things. A declared equivalence mapping is an official note from someone trusted saying that a name in one list and a name in another can be used as the same thing, for a certain purpose. It works both ways, and it does not claim they are the same in every possible sense, just for that purpose. Computers that follow the note treat the two as one without checking again. Because everyone relies on the note, it is looked after carefully: it has an author, a version, and a way to take it back if it turns out to be wrong.

Authoritative Cross-Vocabulary Equivalence

A declared equivalence mapping is an explicit, authoritative statement that two concepts from different controlled vocabularies or identifier schemes are interchangeable for stated purposes. The standard example is SKOS exactMatch, which records high confidence that two concepts in different schemes can be used interchangeably across a wide range of information-retrieval applications. The mapping is declared (recorded as a versioned artifact, not guessed by an algorithm), symmetric (it works in both directions), and purpose-bounded (it claims substitutability within a context, not that the two are identical for every possible question). Systems that respect it treat the two concepts as one, without re-checking at use time, so they are trusting the declarer's judgment. That is why it is governed like a document, with an author, purpose, version, and a way to downgrade or revoke it. It also scales well: instead of every consumer matching every pair of schemes, one shared, maintained mapping table handles the matching for everyone.

A declared equivalence mapping is an explicit, authoritative assertion that concepts from two different controlled vocabularies or identifier schemes are interchangeable for stated purposes; the canonical instance is SKOS exactMatch, which records a high degree of confidence that c1 in scheme S1 and c2 in scheme S2 can be used interchangeably across a wide range of information-retrieval applications. Three properties define it: it is declared, a versioned artifact rather than an algorithmic inference; symmetric; and purpose-bounded, asserting substitutability within a defined context rather than ontological identity for every query. Its structural effect is to collapse the cross-scheme distinction to zero for a defined consumer, so systems route, aggregate, or infer over c1 and c2 as one atom without re-verifying the equivalence at use time. Authority is load-bearing: validity rests on the declarer's judgment, so consumers are trusting the declarer's scope assessment, which makes the mapping a governed artifact with an author, stated purpose, version, and retraction channel. It addresses the N-vocabulary integration problem by replacing O(N²) per-consumer re-matching with one centrally maintained mapping table shared across consumers. Examples include LCSH–FAST exactMatch links in library cataloguing, ICD-10 to SNOMED-CT code pairs in clinical coding, Ensembl to HGNC gene-identifier crosswalks, and CRM-to-ERP customer reconciliation in master-data management; in each, fidelity depends on the declaration remaining accurate.

Scope of Application¶

It lives across knowledge-organization and interoperability subfields — a governance practice recurring wherever distinct naming authorities must interoperate over the same N-sovereign-scheme integration problem.

Library systems — SKOS exactMatch between LCSH and FAST subject headings.
Healthcare terminology — ICD-10-to-SNOMED-CT code pairs for routing and reporting.
Bioinformatics — Ensembl-to-HGNC gene-identifier crosswalks.
Master-data management — CRM-to-ERP customer-entity reconciliation.
Regulatory equivalency — a regulator declaring a foreign framework equivalent.
Standards harmonisation — ISO bodies declaring two national standards equivalent.

Clarity¶

Calling a correspondence a declared equivalence locates the source of its authority, separating a recorded judgment from a computed similarity or a metaphysical identity claim. It makes the right question askable — who declared it, for what purpose, is it current — and makes the bounded-purpose qualifier legible, so "they are mapped" stops meaning "the same in every respect."

Manages Complexity¶

Integrating N sovereign vocabularies is an O(N²) tangle of use-time comparisons. The declaration externalises each substitution into one maintained artifact, so the whole consumer population shares a single mapping table instead of each re-deriving the pairwise correspondences. The integrator tracks four fields per use — declarer, purpose, version, currency — converting an open data question into a closed governance lookup.

Abstract Reasoning¶

The construct's moves are a source-of-authority diagnosis; coupled boundary (is the use inside the declared purpose?) and trust (relying is delegated trust) inferences; a failure-attribution move relocating a bad substitution to a stale declaration; an exact-only transitive closure (only all-exactMatch chains compose); and a boundary-on-options move choosing declaration over common-name or translation-layer to preserve scheme sovereignty.

Knowledge Transfer¶

Within knowledge organization the construct transfers as mechanism across a wide set of co-instances — SKOS, clinical coding, gene crosswalks, entity resolution, standards recognition — the full governance apparatus porting intact, because all share the N-sovereign-scheme problem. Off that practice the portable core decomposes into parents: the one-to-one pairing is Bijectivity, and the validity-by-authority-with-scope-and-revocation is generic trust-bridging carried by Certification and naming/authority. Those parents carry any cross-domain lesson; the SKOS grade system stays home-bound.

Relationships to Other Abstractions¶

Current abstraction Declared Equivalence Mapping Domain-specific

Parents (3) — outgoing typed relations

Declared Equivalence Mapping is a kind of Schema Mapping Relation Domain-specific

Declared Equivalence Mapping is the exactMatch species of Schema Mapping Relation, fixing the bridge grade at purpose-bounded interchangeability.
Declared Equivalence Mapping is a kind of Record Reconciliation Prime

Declared Equivalence Mapping is the equivalent-verdict species of Record Reconciliation, made authoritative and purpose-bounded for controlled schemes.
Declared Equivalence Mapping is a decomposition of Equivalence Relation Prime

Removing declaration governance leaves sameness under a stated criterion, with symmetric substitution and exact-only transitive closure.

Hierarchy paths (13) — routes to 9 parentless roots

Declared Equivalence Mapping → is a kind of Schema Mapping Relation → is a kind of Governed Relation Vocabulary → is a decomposition of Schema → is a decomposition of Abstraction

Show alternative paths (12)

Neighborhood in Abstraction Space¶

Declared Equivalence Mapping sits in a moderately populated region (59^th percentile for distinctiveness): it has near-neighbors but no dense thicket of look-alikes.

Family — Controlled Vocabularies & Term Mapping (22 abstractions)

Nearest neighbors

Computed from structural-signature embeddings · 2026-10-25