I-Match

I-Match lexicon-based similarity algorithm - customizable duplicate detection using word dictionaries

Similarity

Input Texts

Text 1

Text 2

Parameters

Lexicon (comma-separated words)*

Minimum Intersection

Hash Outputs

Format:

Algorithm Info

Similarity

I-Match lexicon-based similarity algorithm - customizable duplicate detection using word dictionaries

Related Algorithms

SimHash

Locality-sensitive SimHash for document similarity - finds near-duplicate content efficiently

MinHash

MinHash for Jaccard similarity estimation - used in duplicate detection and recommendation systems

b-bit MinHash

Compact b-bit MinHash - memory-efficient similarity detection for large-scale applications

SuperMinHash

Enhanced SuperMinHash (2017) - improved accuracy over traditional MinHash for similarity search

Nilsimsa

Nilsimsa hash for spam detection - specialized locality-sensitive hash for email and text analysis