A taxonomy of how meaning gets disguised, organised by mechanism instead of topic
AspireAI community · arXiv
People evade moderation with indirect linguistic expressions - algospeak, euphemisms, adversarial obfuscation - and the existing taxonomies are organised by communicative goal, which makes them brittle as new forms appear. This paper proposes a mechanism-oriented taxonomy that categorises the underlying operations through which meaning is encoded and recovered. Plugged into LLM prompts and compared against four existing taxonomies and a no-taxonomy baseline on 2,000 manually annotated TikTok and Bluesky posts, it attains the strongest document- and span-level performance across three LLMs, with document-level gains of +3.8 accuracy and +4.3 macro-F1 points for GPT-5.4, +0.9/+1.3 for Sonnet 4.6 and +2.1/+2.2 for DeepSeek V4. The authors are straight about the limits: the direction is consistent but the magnitude is model-dependent, and span-level gains come mainly from recall at some cost to precision. A cross-lingual evaluation on 800 Chinese coded-language reviews also favours the taxonomy. Published at EMNLP 2026 Main.
Read the story and explore more from the AspireAI community.
Two sparse-autoencoder analyses have resisted scaling: matching semantically similar features across layers, and compressing large feature circuits into interpretable supernodes. This paper argues both are the same underlying problem, estimating semantic distances between SAE features that sit on different activation manifolds. Its representation treats each feature not as a single decoder vector but as an activation-weighted distribution over the hidden states expressing it, projects those distributions into a shared reference space, and compares them with Wasserstein distance. The representation is proved invariant to activation rescaling and stable under perturbation, and recovers true matches under finite-sample margin conditions. Empirically it outperformed decoder-vector and LLM-based baselines and captured subtle functional distinctions between related features, and it compressed large feature circuits into interpretable supernodes automatically. The limitation is that this is interpretability tooling: the paper demonstrates better feature matching and circuit compression, not that downstream interpretability claims become more accurate.