Avi Caciularu, Itzik Malkiel, Oren Barkan, Noam Koenigstein, Dvir Ginzburg
We have not lifted any functions out of this paper's repositories yet, so there is nothing we have run. The repositories linked to it are listed below.
Some links come from the archived Papers with Code dataset (CC BY-SA 4.0): attribution and licence.
We present a novel model for the problem of ranking a collection of documents according to their semantic similarity to a source (query) document. While the problem of document-todocument similarity ranking has been studied, most modern methods are limited to relatively short documents or rely on the existence of "ground-truth" similarity labels. Yet, in most common real-world cases, similarity ranking is an unsupervised problem as similarity labels are unavailable. Moreover, an ideal model should not be restricted by documents' length. Hence, we introduce SDR, a self-supervised method for document similarity that can be applied to documents of arbitrary length. Importantly, SDR can be effectively applied to extremely long documents, exceeding the 4, 096 maximal token limit of Longformer. Extensive evaluations on large documents datasets show that SDR significantly outperforms its alternatives across all metrics. To accelerate future research on unlabeled long document similarity ranking, and as an additional contribution to the community, we herein publish two humanannotated test-sets of long documents similarity evaluation. The SDR code and datasets are publicly available 1 . * , § Denotes equal contribution.
The same record, over MCP at https://syntology.ai/mcp:
get_harvested_code_for_paper("2106.01186")
get_code_for_paper("2106.01186")
have("2106.01186")
The run record, dated, one paper per request, free:
curl https://syntology.ai/api/ran/2106.01186.json
A badge for a README (the split and the date, never a ratio):
[](https://syntology.ai/paper/2106.01186)
Connect an agent — have() is free.