This is a Java based implementation of the locality sensitive hashing algorithm to find pairs of sentences that are copies of one another. Locality sensitive hashing algorithm is described in the document Mining of Massive Datasets by A. Rajaraman and J. Ullman1
tharindukumara / locality-sensitive-hashing Goto Github PK
View Code? Open in Web Editor NEWThis is an implementation of the locality sensitive hashing algorithm to find pairs of sentences that are copies of one another. Locality sensitive hashing algorithm is described in the document Mining of Massive Datasets by A. Rajaraman and J. Ullman1