From what I understand hamming distance is currently bitwise, aka considers all non-zero elements as equal. Would it be possible to add a more generic version (maybe call it overlap) that would count all matching elements in the two vectors? This is a more standard definition of the hamming distance.
From what I understand hamming distance is currently bitwise, aka considers all non-zero elements as equal. Would it be possible to add a more generic version (maybe call it
overlap
) that would count all matching elements in the two vectors? This is a more standard definition of the hamming distance.