Performing pairwise comparisons in a corpus is time-consuming because the number of comparisons grows geometrically with the size of the corpus. Most of those comparisons, furthermore, are unnecessary because they do not result in matches. The combination of minhash and locality-sensitive hashing (LSH) seeks to solve these problems. They make it possible to compute possible matches only once for each document, so that the cost of computation grows linearly rather than exponentially. This vignette explains how to use the minhash and locality-sensitive hashing functions in this package. For an explanation of why they work, see Jure Leskovec, Anand Rajaraman, and Jeff Ullman, Mining of Massive Datasets (Cambridge University Press, 2011), ch. 3. (This blog post is a more succinct explanation.)
We begin by creating a minhash function. A minhash function converts tokenized text into a set of hash integers, then selects the minimum value. This is the equivalent of randomly selecting a token. The function then does the same thing repeatedly with different hashing functions, in effect selecting
n random shingles. The additional hashing functions come from a bitwise XOR with random integers. That is why the
minhash_generator() accepts a seed, so that we can re-create the same minhash function again. In other words, a minhash function converts a set of tokens of any length into
n randomly selected and hashed tokens.
##  -1067902788 -349477925 -1306490031 -926753052 -1222296305 -1443723653
Now when we load our corpus, we will tokenize our texts as usual, but we will use our generated
minhash() function to compute the hashes. We specify that we want to create a minhash signature by passing our minhash function to the
minhash_func = parameter.
We can verify that we have minhashes in our corpus:
##  -2147421589 -2147475954 -2147470602 -2147373716 -2147464099 -2147477501
##  240
Now all our documents are represented by
n = 240 randomly selected and hashed shingles. Comparing those shingles should be the equivalent of finding the Jaccard similarity of the two documents. However, we still have the problem of pairwise comparison.
The locality-sensitive hashing algorithm, provided in this package by the
lsh() function, solves this problem. LSH breaks the minhashes into a series of bands comprised of rows. For example, 200 minhashes might broken into 50 bands of 4 rows each. Each band is hashed to a bucket. If two documents have the exact same minhashes in a band, they will be hashed to the same bucket, and so will be considered candidate pairs. Each pair of documents has as many chances to be considered a candidate as their are bands, and the fewer rows there are in each band, the more likely it is that each document will match another.
How likely is it, then, that we will detect a match? The probability of a match depends on the Jaccard similarity of a pair of documents. The more similar two documents are, the more likely they are to be considered candidates, which is what we want. The probability of a match is an S-curve (see Leskovec, Rajaraman, and Ullman), so there is a threshold Jaccard similarity above which documents are likely to be a match. We can calculate the likely threshold based on the number of minhashes and bands that we are using.
##  0.3760603
##  0.2320794
Using 240 minhashes and 80 bands, we will likely detect documents with an actual Jaccard similarity of above 0.232. We can also estimate the probability that a pair of documents with a Jaccard similarity
s will be marked as potential matches.
##  0.7163087
##  1
These numbers seem reasonable for our purposes, so we will set the number of minhashes at 240 and the number of bands at 80.
Now we can use the
lsh() function to calculate the locality-sensitive hashes for our documents.
## # A tibble: 640 x 2 ## doc buckets ## <chr> <chr> ## 1 calltounconv00baxt 94857bb94afab43e61fbdb7bc720d879 ## 2 calltounconv00baxt a3b655b3a4da5b2615ad14b8b0a40c79 ## 3 calltounconv00baxt 3a7dc2db81e921147904e776e51682c1 ## 4 calltounconv00baxt d25c0330cfb7c5351c641b6fd66e9d9e ## 5 calltounconv00baxt 17d4e4e622ed0e22ada62b3021710f5c ## 6 calltounconv00baxt 6541b20eeb120392f7aa84e4efe000f9 ## 7 calltounconv00baxt 5662312d987a1e8cfb39a8768e6373fa ## 8 calltounconv00baxt 36409960b62875444d6bc8b140d07a9d ## 9 calltounconv00baxt 239d06f6ef65a388dc2e3fa15a83fe3b ## 10 calltounconv00baxt 5fa1e53764fce4042dc15e56a1323b54 ## # … with 630 more rows
Note that using the LSH method only requires us to calculate the signatures (or buckets) for each document one time. This implies that we can take several data frames of LSH signatures and bind their rows together (e.g., with
dplyr::bind_rows()). This permits us to compute the signatures for only part of a corpus at a time, or to continue to add to the corpus. Note, however, that you must use the same minhash function, generating the same number of minhashes and using the same seed and you must use the same number of bands in order to get valid results.
We can extract the potential matches from the cache using
lsh_candidates(). The first function returns matches for only one document, specified by its ID; the second functions returns all potential pairs of matches.
## # A tibble: 1 x 2 ## a b ## <chr> <chr> ## 1 calltounconv00baxt lifeofrevrichard00baxt
## # A tibble: 3 x 3 ## a b score ## <chr> <chr> <dbl> ## 1 calltounconv00baxt lifeofrevrichard00baxt NA ## 2 practicalthought00nev thoughtsonpopery00nevi NA ## 3 remember00palm remembermeorholy00palm NA
Notice that LSH has identified the same three pairs of documents as potential matches that we found with pairwise comparisons, but did so much faster. But we do not have similarity scores; we only know that these documents are likely to have Jaccard similarity scores above the 0.232 threshold.
Now we can use
lsh_compare() to apply a similarity function to the candidate pairs of documents. Note that we only have to do 3 comparisons for all the candidates, instead of 28 pairs when comparing all 8 documents in the corpus pairwise.
## # A tibble: 3 x 3 ## a b score ## <chr> <chr> <dbl> ## 1 calltounconv00baxt lifeofrevrichard00baxt 0.281 ## 2 practicalthought00nev thoughtsonpopery00nevi 0.463 ## 3 remember00palm remembermeorholy00palm 0.701
Note that these results are identical to what we calculated in the pairwise vignette, but required much less computation.