70Deduplicate near-identical documents in a huge corpus. Implement MinHash for fast similarity.▼hardGoogleScale AIDatabricks2 replies◆ premiumComparing all pairs across a million documents is a trillion comparisons. MinHash estimates Jaccard similarity from a tiny signature, and LSH converts dedup into a near-linear scan. Here is the implementation.Open full answer →
58Turn a raw web crawl into a clean trillion-token LLM training corpus. Design the pipeline.▼hardNVIDIAAnthropicOpenAI◆ premiumAnyone can say 'filter and dedup.' The signal is the funnel arranged by cost, the MinHash/LSH banding math, and recognizing that the shuffle across billions of documents is what actually runs up the bill, plus the benchmark decontamination people forget until their eval numbers get challenged.Open full answer →