The notebook distance_patternscontains a visual inspection of distances between bit strings.
The idea is:
- take a string distance
- take the first
n=512integers sorted - represent them as bit strings
- compute the distance matrix between them.
You can can find some of the generated patterns below. Can you guess which distance corresponds to which picture? Here is a clue: there are the Hamming distance, the edition distance (a.k.a. Levenshtein), the Jaccard distance and the 1d wasserstein distance.
All the answers are in the notebook. If you have problems seeing the notebook, you can go here.
