Document Similarity Metrics (DSM)

• Document Similarity Metric (DSM) is a quantitative function mapping document pairs to similarity scores or distances, using methods from cosine to graph-based similarities.
• DSM methodologies span vector/set-based, graph/link-based, and structure/alignment-based approaches, each employing distinct scoring strategies for diverse applications.
• Context- and aspect-conditioned DSMs refine similarity by incorporating facets such as methodology or citation intent, thereby improving retrieval, recommendation, and clustering accuracy.

Searching arXiv for recent and foundational papers on document similarity metrics. arXiv search query: "document similarity metric document reconstruction contextual similarity aspect-based similarity" Document Similarity Metric (DSM) denotes a quantitative function that assigns a similarity score or a distance to a pair of documents, but the term is used in two distinct ways in the literature: as a generic designation for document–document scoring functions, and as the name of specific metrics proposed for particular tasks such as document reconstruction. Across information retrieval, scientometrics, legal retrieval, biomedical retrieval, multilingual alignment, and document analysis, DSMs range from lexical and embedding-based scores to aspect-conditioned, graph-based, syntactic, and structure-aware formulations (Gahman et al., 2023, Ostendorff, 2020, Li et al., 8 Jul 2025).

1. General definition and mathematical status

At its most general, a DSM maps a document pair to either a similarity value or a distance. One survey states this as either a similarity score $s(D_1,D_2)\in[0,1]$ or a distance $d(D_1,D_2)\ge 0$, and distinguishes proper metrics from broader similarity functions (Gahman et al., 2023). In contextual similarity for scientific literature, the function is extended to a triple of two documents and a context, $S: D \times D \times C \to [0,1]$, making explicit that similarity may depend on a specified facet such as background, methodology, or findings (Ostendorff, 2020).

A central issue is that “metric” is often used loosely. The contextual-document-similarity thesis explicitly does not require triangle inequality or related metric axioms, and treats symmetry as contingent on representation and modeling choice: cosine over context-specific text representations and citation-based measures such as bibliographic coupling and co-citation are symmetric, whereas learned pairwise models may become asymmetric if directional cues are encoded (Ostendorff, 2020). More generally, cosine similarity, BM25, and soft cosine are not metrics, while Euclidean distance, Jaccard distance, Jensen–Shannon distance, Word Mover’s Distance under the stated conditions, and Levenshtein distance are treated as metrics in the surveyed literature (Gahman et al., 2023).

This distinction matters because different applications require different invariants. Retrieval and recommendation typically need a ranking-compatible score; clustering or indexing may require stronger geometric properties; aspect-based exploration requires explicit conditioning rather than a single global score. A plausible implication is that DSM is better understood as a design space than as a single canonical formula.

2. Major representational families

The literature organizes DSMs around the representation of documents and the mechanism used to compare them. Statistical and vector-space DSMs operate on bag-of-words, TF–IDF, shingle sets, or dense embeddings and use cosine, Jaccard, Euclidean distance, BM25-style scoring, or related functions (Gahman et al., 2023, Mihajlovic et al., 2019). Set-based DSMs can also be made corpus-aware: the Sp measure assigns per-term similarity according to the empirical rarity of matching or near-matching frequencies across the corpus, rather than relying on explicit TF–IDF weighting (Aryal et al., 2019). Density Similarity represents a document as a smoothed density over embedding space and compares sampled density vectors by cosine similarity (Rushkin, 2020).

Graph and link-based DSMs treat documents as nodes connected by citations or hyperlinks. In scientific literature these include bibliographic coupling, co-citation, and Co-citation Proximity Analysis, while graph embedding methods such as DeepWalk, node2vec, LINE, and GEMSEC learn document representations from link structure (Ostendorff, 2020). Legal-document similarity studies evaluate both direct citation-overlap measures and node embeddings over citation graphs, and report that Node2Vec on the legal citation graph outperforms simpler citation-overlap baselines in sparse settings (Bhattacharya et al., 2020).

Structural and alignment-based DSMs compare sequences, trees, or page elements rather than unordered token sets. SimDoc models documents as sentence-segmented sequences of latent topics and applies Smith–Waterman-style local alignment to topic sequences (Maheshwari et al., 2016). FastKASSIM compares constituency parse trees with normalized label-based tree kernels and aggregates sentence matches via maximum-cost bipartite matching (Chen et al., 2022). DREAM defines a page-level DSM for document reconstruction by combining element category, bounding-box overlap, transcription edit distance, and reading order through dynamic programming over element sequences (Li et al., 8 Jul 2025).

Family	Representation	Scoring principle
Vector/set-based	BoW, TF–IDF, shingles, embeddings	cosine, Jaccard, BM25, corpus-aware overlap
Link/graph-based	citations, hyperlinks, node embeddings	bibliographic coupling, co-citation, graph-embedding cosine
Alignment/structure-based	topic sequences, parse trees, layout elements	dynamic programming, Hungarian matching, edit distance, tree kernels
Aspect-conditioned	sections, citation intents, natural-language aspects	per-aspect score, classifier probabilities, weighted aggregation

These families are not mutually exclusive. Several recent systems explicitly fuse text, links, structure, and aspect information, or use one family for candidate generation and another for reranking.

3. Context-, aspect-, and facet-conditioned similarity

A major development is the move from holistic similarity to conditioned similarity. In contextual document similarity for literature recommender systems, similarity is formalized as a context-dependent function over $(d_i,d_j,c)$, and a unified DSM is expressed as

$$\mathrm{DSM}(d_i,d_j)=\sum_{c\in C} w_c \cdot S(d_i,d_j \mid c),$$

with nonnegative weights summing to one (Ostendorff, 2020). Contexts may be section-based facets such as Introduction or Methods, citation-intent labels, or knowledge-graph-derived facets such as method and resource. Querying then becomes explicitly facet-aware, as in “Find papers similar to $X$ with respect to methodology” (Ostendorff, 2020).

For research papers, aspect-based similarity has been operationalized as pairwise multi-label classification. In this formulation, citations provide supervision: the section title in which a citation occurs becomes the aspect label for the citing–cited pair. The output is a vector of aspect-conditioned probabilities $s_a(d_i,d_j)=P(a\mid d_i,d_j)$, which may be aggregated for ranking. Experiments on 172,073 paper pairs from ACL Anthology and CORD-19 show SciBERT as the best-performing model, with macro-F1 and micro-F1 of 0.326 and 0.678 on ACL, and 0.439 and 0.833 on CORD-19 (Ostendorff et al., 2020).

The most explicit recent formulation is ASPECTSIM, which conditions similarity on a user-specified aspect expressed in natural language. It defines an aspect-conditioned function $S(d_i,d_j\mid a)$ and supports both direct LLM judging and a two-stage extract-then-embed procedure, with multi-aspect aggregation

$$\mathrm{DSM}(d_i,d_j)=\sum_{k=1}^{K} w_k S(d_i,d_j\mid a_k).$$

On a benchmark of 26K aspect-document pairs, GPT-4o-based ASPECTSIM achieved approximately 80% higher human-machine agreement than holistic similarity without explicit aspects, while a two-stage refinement improved smaller open-source LLMs by approximately 140% over direct prompting (Hossain et al., 6 Jan 2026). This suggests a clear conceptual shift: similarity is no longer only a property of a document pair, but of a document pair under a comparison criterion.

4. Structure-aware DSMs

Some DSMs are designed for outputs whose structure is intrinsic to correctness. DREAM’s DSM, introduced for document reconstruction, evaluates a reconstructed page holistically by combining element-level location cost and transcription cost, then aggregating them through dynamic programming over reading-order sequences. The score is normalized to $[0,1]$ and is intended to capture category correctness, spatial overlap, content fidelity, and sequence consistency in a single value (Li et al., 8 Jul 2025). On DocRec1K, the reported DSM scores are 65.3 for PaddleOCR, 81.7 for Pix2Struct(base), 85.2 for Nougat(base), and 91.4 for DREAM (Li et al., 8 Jul 2025).

Sequence alignment also appears in semantic DSMs. SimDoc maps documents to sequences of latent topics inferred by LDA, segments them by sentence, and aligns both topic tokens and sentence sequences with Smith–Waterman-style recurrences. Its central claim is that thematic flow is pivotal for document similarity and is disregarded by bag-of-words techniques (Maheshwari et al., 2016). The same general principle appears in compression-based estimates of Levenshtein distance: documents are compressed into signatures by a rolling-window lossy compression algorithm, edit distance is computed on the signatures, and the result is rescaled to estimate document-level edit distance and a normalized DSM (Coates et al., 2023).

Syntactic DSMs operate on parse trees rather than semantic content. FastKASSIM replaces edit-distance-based syntactic comparison with a normalized label-based tree kernel and then aggregates the most similar sentence pairs via the Hungarian algorithm, penalizing length mismatches by normalization with the larger sentence count (Chen et al., 2022). It is reported to run up to 5.32 times faster than CASSIM on r/ChangeMyView and to discriminate more reliably between syntactically similar and dissimilar documents (Chen et al., 2022). A common theme across these methods is that document similarity is treated as an alignment problem over structured units rather than as a static comparison of pooled features.

5. Semantic, relational, and domain-specific formulations

In biomedical retrieval, one DSM represents each document as a set of predications, that is, subject–predicate–object triples extracted from text. Concept similarity is computed by Jaccard overlap over UMLS ancestor sets, relation similarity is defined analogously over the UMLS Semantic Network, predication similarity is a weighted average of subject, relation, and object similarities, and document similarity is the average of bidirectional maxima across the two predication sets (Gunaratna, 2016). On a corpus of 907 MEDLINE/PubMed documents, this predication-based DSM yields top-5 precision of 0.7733 and top-30 precision/recall/F-measure of 0.4433 (Gunaratna, 2016).

In legal information retrieval, DSMs combine textual and jurisprudential structure. A comparative study over 53,210 Supreme Court of India judgments evaluates Doc2Vec on full text, section-aware thematic similarity, bibliographic coupling, co-citation, dispersion, and Node2Vec over the citation graph. The best single text method is full-text Doc2Vec with Pearson correlation 0.605 to expert judgments; the best graph-only method is Node2Vec with 0.487; and the best reported hybrid is FullText plus Bibliographic Coupling under max aggregation with correlation 0.626 (Bhattacharya et al., 2020). The same study argues that a robust legal DSM should capture semantic relevance, exploit citation structure, handle long heterogeneous documents, remain robust under sparse citations, and scale to large corpora (Bhattacharya et al., 2020).

Other domain-specific DSMs emphasize latent semantics or knowledge representation. For texts of varying lengths, a hidden-topic DSM projects long documents into a low-dimensional topic subspace learned by truncated SVD and scores short summaries by their relevance to the document’s hidden topics; on a concept–project matching task, the science-domain version reports precision 0.758, recall 0.885, and F1 0.818 (Gong et al., 2019). Topic-map-based similarity transforms documents into rooted ordered trees of topics and relations and measures similarity as correlation between common subtree patterns; in clustering experiments it reports higher purity and lower entropy than cosine, Jaccard, Euclidean, and KLD baselines across NEWS20, Reuters, WebKB, Classic, and OHSUMED (Rafi et al., 2013). These models indicate that in specialized domains, useful similarity often depends on explicit structure in knowledge representations rather than on surface text alone.

6. Scalability, evaluation, and persistent limitations

DSM evaluation is task-dependent. Recommendation systems for scientific documents use AP, nDCG, CTR, and online click behavior, while noting that CTR is not always aligned with semantic relevance (Ostendorff, 2020). Legal DSMs are evaluated by Pearson correlation with expert similarity scores (Bhattacharya et al., 2020). Multilingual document alignment uses recall over date-filtered candidate sets and shows that ITML- and SDML-trained Mahalanobis metrics over multilingual sentence embeddings outperform unsupervised cosine or Euclidean baselines, with XLM-R plus ITML remaining strong even with 1,000 parallel sentence pairs (Rajitha et al., 2021). Reconstruction-specific DSMs, such as DREAM’s, define their own normalized page-level score and complement it with subtask diagnostics (Li et al., 8 Jul 2025).

Scalability has become a first-class design concern. Density Similarity represents documents as sampled densities over embedding space and reports accuracy close to RWMD with very large speed gains; in People→People recommendation, RWMD required more than 100 hours, whereas DS with $d(D_1,D_2)\ge 0$0 required 654 seconds total (Rushkin, 2020). DotHash provides an unbiased estimator of set intersection size, thereby estimating Jaccard and weighted-overlap families such as Adamic–Adar and IDF-weighted overlap with an $d(D_1,D_2)\ge 0$1 dot product; in document deduplication it matches or exceeds MinHash accuracy and outperforms SimHash while remaining comparable in complexity (Nunes et al., 2023). Compression-based signatures reduce approximate Levenshtein comparison from quadratic dependence on original lengths to quadratic dependence on compressed signatures, with an approximate speedup factor of $d(D_1,D_2)\ge 0$2 under compression factor $d(D_1,D_2)\ge 0$3 (Coates et al., 2023).

Despite their variety, DSMs exhibit recurring limitations. Contexts and aspects may be ambiguous or overlapping; section boundaries are often fuzzy; citation-based measures inherit community citation bias and temporal dependence; Transformer-based full-text encoding is computationally heavy; syntactic metrics depend on parser quality; and structure-aware metrics may penalize semantically equivalent but syntactically or markup-different renderings (Ostendorff, 2020, Chen et al., 2022, Li et al., 8 Jul 2025). Aspect-conditioned systems reduce ambiguity but require well-defined aspects and reliable aspect evidence, and open-source models still lag behind large proprietary models in aspect-conditioned agreement (Hossain et al., 6 Jan 2026). The cumulative literature therefore points toward a plural conclusion: no single DSM is universally adequate, and the appropriate metric is determined by representation, task, supervision regime, structural assumptions, and the specific meaning of “similarity” required by the application.