Jaccard Similarity — A Simple Example
For a given term (say fraud) in a given year, you have two separately-trained Word2Vec models — one on Democrat emails, one on Republican emails. From each you pull the top-10 nearest-neighbor words to fraud. Jaccard asks: how much do those two neighbor lists overlap?
Notice the similarity scores are thrown away — only the words matter ( for in ...). It's purely set membership: is a word in both top-10 lists or not.
Simple example
Say for fraud in 2020, with :
| Party | Top-10 neighbors of fraud |
|---|---|
| Democrat | voter, suppression, myth, baseless, claims, debunked, false, gop, lie, disinformation |
| Republican | voter, ballot, illegal, dead, mail, cheating, stolen, rigged, machines, claims |
Now compare the sets:
- ∩ Intersection (in both) voter, claims → 2 words
- ∪ Union (in either, counted once) the 10 Dem + 10 Rep minus the 2 shared = 18 words
How to read it
- 1.0 → identical neighbor lists. Both parties surround the word with the same associations → convergence / shared meaning.
- 0.0 → zero shared neighbors. The parties embed the word in completely different contexts → maximum divergence / polarization.
- 0.11 The example's says Dem and Rep talk about "fraud" in largely different terms — Democrats frame it around debunking/suppression, Republicans around mechanisms of alleged cheating.
A discrete ladder
Since both lists always have 10 words, the union ranges from 10
(identical) to 20 (nothing shared), so with the possible
Jaccard values are a discrete ladder:
. That's why the low values on your
plot cluster around 0–0.18 rather than varying continuously.