dictionary (two-key associations)

Using two keys (k1, k2) to identify segmented memory: k1 as object/segment, k2 as slot/field.

Neighborhood — ranked by edge-count

method

application read/write functions r and w
associated_with
Higher-level semantic operations that map the primitive memory operations to application-level semantics.

concept

virtual memory with segment identifier
extends
A specialisation of dictionaries where k1 is a segment identifier and k2 is an in-segment address.

cosine ≥ 0.65 · no typed edge

Entities in the same semantic neighborhood but without a typed relation to this one — candidates for new edges or unrecognized duplicates.

associationconcept0.766
Connections made across texts by recollection, probability, and spatial proximity, not linear sequence.
lock-and-key relationshipframework0.750
The highly specific fit between a new building volume and the existing configuration, analogous to protein-ligand binding.
Pair Typeframework0.738
Indexable container with denotation as Bool → a; example demonstrating derivation of API instances from semantic denotation.
What Is The Relationship Or Overlap Between Thequestion0.738
whether many (maybe even all) useful organisations of information and behaviour in a dynamic language might be constructed from a single primitive operation: n-way associative lookupquestion0.734
The central research question explored, by way of examples, throughout the paper.
"A tale of two densities, as it were."concept0.731
Metaphorical framing of generative and recognition models as interactive pair; title origin
Associations are made across, by recollection, probabilistically.claim0.728
Grounds textual association in memory and chance, not fixed links.
Implication (A → B)concept0.727