'I thought that maybe the set intersection would be faster with hashes:
wrong!
tokenized_set fail rate: 0.120689655172
Total time: 6.78003907204s
Analyzed samples: 1218'

def test_tokenized_set_str_hash(self):

    def tokenized_set(str_a, str_b, ratio):
        set_a = set((hash(x) for x in str_a.split('    ')))
        set_b = set((hash(x) for x in str_b.split('    ')))
        maxl = max(len(set_a), len(set_b))
        return ((len(set_a.intersection(set_b)) / maxl) > ratio)
    self.generic_fuzzy_string_diff_runner_against_404(tokenized_set, IS_EQUAL_RATIO)
