|Perl Monk, Perl Meditation|
bit array comparisonby Amendil (Novice)
|on Oct 22, 2019 at 12:27 UTC||Need Help??|
Amendil has asked for the wisdom of the Perl Monks concerning the following question:
Hello Perl Monks,
I'm working on a tsv, one of its columns is a csv list of keywords (28 unique values). I'd like to compute the Jaccard Index (Intersection / Union) of this list of keywords. To do so efficiently I'd like to use a bit array to represent the list of keywords.
I tried to read few articles on Perlmonks and stackoverflow, but so far I feel I'm missing something completely obvious.
Here is what I wrote: