High Volume Event Deduplication

via “document-level deduplication with hash-based matching”

30 trillion token web dataset with 40+ quality signals per document.

Unique: Uses document-level hash-based deduplication (preserving document boundaries) rather than token-level or fuzzy matching, enabling reproducible filtering and transparent deduplication hashes that users can inspect and verify. Processes 84 CommonCrawl dumps with consistent deduplication methodology.

vs others: Document-level deduplication is more interpretable and reproducible than token-level approaches, and the published deduplication hashes enable users to understand and verify which documents were removed, unlike proprietary datasets that hide deduplication decisions.

via “content-based deduplication at file and repository levels”

67 TB permissively licensed code dataset across 600+ languages.

Unique: Two-stage deduplication combining exact hash matching with fuzzy similarity matching (likely MinHash or Jaccard) to catch both identical and near-identical code — more thorough than single-stage approaches but computationally expensive

vs others: More aggressive deduplication than CodeSearchNet (which uses simple hash matching) because it catches near-duplicates, but less semantic than clone detection tools (which understand code structure) because it's content-based

via “minhash-based deduplication at petabyte scale”

Hugging Face's 15T token dataset, new standard for LLM training.

Unique: Uses MinHash locality-sensitive hashing for memory-efficient duplicate detection across 15 trillion tokens, avoiding the need to store full document hashes or maintain a global hash table. This enables processing at petabyte scale where naive approaches would exhaust available memory.

vs others: More memory-efficient than exact deduplication (which requires storing full hashes) and faster than string-similarity-based approaches (which require pairwise comparisons), making it practical for web-scale datasets where C4 and similar datasets use simpler or less effective deduplication strategies.

via “sentence-level deduplication at scale”

Google's cleaned Common Crawl corpus used to train T5.

Unique: Applies sentence-level deduplication at scale across 750GB using deterministic techniques, removing redundant training examples while maintaining document structure; enables cleaner training data without requiring learned quality models

vs others: More thorough than document-level deduplication; simpler and more reproducible than semantic deduplication approaches; reduces training data size but may miss near-duplicates that learned methods would catch

via “memory quality assurance and deduplication”

AI memory OS for LLM and Agent systems(moltbot,clawdbot,openclaw), enabling persistent Skill memory for cross-task skill reuse and evolution.

Unique: Implements asynchronous deduplication with configurable merge strategies and embedding-based similarity detection, running as a background scheduler task — unlike manual deduplication, MemOS automates duplicate detection and merging.

vs others: Prevents memory bloat through automatic deduplication; requires careful threshold tuning to avoid false positives (merging distinct memories) or false negatives (missing duplicates).

via “similarity-based memory deduplication with configurable thresholds”

Core library for membank — handles storage, embeddings, deduplication, and semantic search.

Unique: Performs deduplication at insertion time using embedding similarity rather than exact matching, catching semantic duplicates that keyword-based deduplication would miss. Threshold configuration allows tuning sensitivity without code changes.

vs others: More effective than hash-based deduplication because it catches semantically similar memories even with different wording, whereas exact matching only catches identical text.

via “deduplication at document and near-duplicate levels”

Dataset by HuggingFaceFW. 6,43,166 downloads.

Unique: Applies both exact and near-duplicate deduplication at Common Crawl scale with explicit benchmark contamination prevention, ensuring evaluation integrity — most web corpora lack deduplication or benchmark-aware filtering

vs others: Prevents benchmark leakage that affects model evaluation fairness, whereas raw Common Crawl and many other corpora do not address this issue

via “deduplication and redundancy removal at scale”

Dataset by HuggingFaceFW. 4,14,812 downloads.

Unique: Applies document-level deduplication using scalable algorithms (likely MinHash or similar) across the full 3.5B token corpus during preprocessing, removing both exact and near-duplicate content before release. Deduplication is transparent to users but not configurable post-hoc.

vs others: More efficient for training than raw Common Crawl or unfiltered FineWeb because redundancy is pre-removed, reducing wasted compute on duplicate examples; more principled than ad-hoc deduplication in training scripts because it's applied consistently across the full corpus.

via “content deduplication and consolidation”

Summarize Anything, Forget Nothing

via “high-volume event deduplication”

via “data-deduplication-and-compression”

via “duplicate-removal-and-deduplication”