Hamming distance

Hamming distance is a way of measuring how similar two pieces of information are. It compares one piece of information to another and counts how many places they are different. For example, if you had two strings of letters: "cats" and "bats", they would have a Hamming distance of 1 because only one letter is different.

Related topics others have asked about:

Closest string, Damerau–Levenshtein distance, Euclidean distance, Gap-Hamming problem, Gray code, Jaccard index, Jaro–Winkler distance, Levenshtein distance, Mahalanobis distance, Mannheim distance, Sparse distributed memory, Sørensen similarity index