LlamaIndex published the Document Parsing Protocol: 140 rules that define what a correctly parsed page looks like, so parsers can be compared instead of trusted
AspireAI community · LlamaIndex Blog
Parsing a page into structured text or Markdown means making a run of judgment calls: is this aligned text a table or just layout, does a header spanning two rows stay two rows, does a table continuing onto the next page count as one table or two. Different parsers make different calls, so two parsers can capture every word on a page and still hand an agent outputs that mean different things, and an agent works only from what the parser hands it. The Document Parsing Protocol is a proposed answer key for document parsing, published as working draft 0.1 with 140 rules covering text, tables, forms, charts and diagrams, each with example pages and the expected output. It grew out of the rules annotators followed when labelling pages for the ParseBench benchmark, and DPP counts three different renderings of the same sales table as all wrong unless each header row is preserved exactly as printed, which in practice means emitting an HTML table. The honest limitation is that this is a draft proposal, not an adopted standard.
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.