method
active
method:edit-k-nnEdit k-NN
Computes edit distance required to match nearest neighbors between two datasets, normalized by maximum edit distance
Neighborhood — ranked by edge-count
Methods (1)
method
- Edit Distance k-NNrelated_toAlternative alignment metric compared in appendix; computes edit distance between nearest neighbor lists
Related by similarity (8)
cosine ≥ 0.65 · no typed edgeEntities in the same semantic neighborhood but without a typed relation to this one — candidates for new edges or unrecognized duplicates.
- Alternative alignment metric; measures whether nearest neighbor in one domain also considers original sample as nearest neighbor in other domain
- Calculates the longest common subsequence of nearest neighbors normalized by sequence length
- Alternative alignment metric compared in appendix; calculates longest common subsequence of nearest neighbor lists
- A form of attention head composition where W_K reads from a subspace affected by a previous head; central to how induction heads are implemented
- Technique for modifying model knowledge or behavior via targeted interventions, e.g., ROME by Meng et al.
- Application enabled by VPD: direct manipulation of weight matrices for interpretable model modification.
- Statistical model of next-letter probabilities used by Shannon.
- The single primitive operation of looking up a value from a set of n keys.