Relevancy - I'd guess it's difficult to measure, due to the large dataset, the large number of possible search terms, and large number of possible results.
Neat! I wonder if you quantified the performance of your search somehow? I guess labelling data for that would be laborious.
Nice! > found the Python hash() function returns different outputs for the same input when you restart the interpreter I wasn't aware of this >>
thanks for the post, it inspired this naive code: class BloomFilter: def __init__(self, size): self.f = [0] * size def contains(self, s): h1, h2, h3 = self.hashes(s) if self.f[h1] * self.f[h2] * self.f[h3] == 1: return…
Relevancy - I'd guess it's difficult to measure, due to the large dataset, the large number of possible search terms, and large number of possible results.
Neat! I wonder if you quantified the performance of your search somehow? I guess labelling data for that would be laborious.
Nice! > found the Python hash() function returns different outputs for the same input when you restart the interpreter I wasn't aware of this >>
thanks for the post, it inspired this naive code: class BloomFilter: def __init__(self, size): self.f = [0] * size def contains(self, s): h1, h2, h3 = self.hashes(s) if self.f[h1] * self.f[h2] * self.f[h3] == 1: return…