{
  "$type": "site.standard.document",
  "bskyPostRef": {
    "cid": "bafyreicrumezvgktk34xvyitcvbu3gqmk7cw3fgkiau5j4kphlclpxf3w4",
    "uri": "at://did:plc:3fychdutjjusoqeq24ljch6q/app.bsky.feed.post/3mk5a2c6b63m2"
  },
  "coverImage": {
    "$type": "blob",
    "ref": {
      "$link": "bafkreiflo6xt7is6b2iafwghkjahlgggocme5jwjsbeuqqwcywuvjhmszm"
    },
    "mimeType": "image/png",
    "size": 24783
  },
  "path": "/abs/2604.20633v1",
  "publishedAt": "2026-04-23T00:00:00.000Z",
  "site": "https://arxiv.org",
  "tags": [
    "Grant Molnar"
  ],
  "textContent": "**Authors:** Grant Molnar\n\nWe define a multi-scale metric $d_ρ$ on strings by aggregating angle distances between all $n$-gram count vectors with exponential weights $ρ^n$. We benchmark $d_ρ$ in DBSCAN clustering against edit and $n$-gram baselines, give a linear-time suffix-tree algorithm for evaluation, prove metric and stability properties (including robustness under tandem-repeat stutters), and characterize isometries.",
  "title": "A weighted angle distance on strings"
}