def comp_strs_jaccard_similarity(str1, str2):
    """
    Compare strings: Jaccard similarity:
    Return set similarity metric [0-1] for two sets of unique terms.

    Similarity = shared terms / all terms.

    NOTES:
    -  Could speed up an implementation?
    -  Could compute on tf-idf matrix, rather than as pairs?
    """
    set1 = set(str1.split())
    set2 = set(str2.split())
    similarity = float(len(set1.intersection(set2))*1.0/len(set1.union(set2))) ## similarity [0,1], 1 = exact replica.
    similarity = round(similarity, 2)
    return similarity