I have two lists with usernames and I want to calculate the Jaccard similarity. Is it possible? 

[This](https://stackoverflow.com/questions/11911252/python-jaccard-distance-using-word-intersection-but-not-character-intersection) thread shows how to calculate the Jaccard Similarity between two strings, however I want to apply this to two lists, where each element is one word (e.g., a username).
['https://Stackoverflow.com/questions/46975929', 'https://Stackoverflow.com', 'https://Stackoverflow.com/users/873309/']
You can use the [Distance](https://github.com/doukremt/distance) library 

```
#pip install Distance

import distance

distance.jaccard("decide", "resize")

# Returns
0.7142857142857143

```
To avoid repetition of elements in the union (denominator), and a little bit faster I propose:

```
def Jaccar_score(lista1, lista2):    
    inter = len(list(set(lista_1) & set(lista_2)))
    union = len(list(set(lista_1) | set(lista_2)))
    return inter/union

```