- The number of positions between two strings of equal length at which the corresponding symbols are different. In other words, the Hamming distance measures the minimum number of substitutions required to change one string into the other, or the minimum number of errors that could have transformed one string into the other. For example, the Hamming distance between “karolin” and “kerstin” is 3. A major application of the Hamming distance is in coding theory. It is named after the mathematician Richard Hamming. ← Wikipedia
- Related terms: Levenshtein distance
- Previous term: HAML
- Next term: Handheld Device Markup Language
- Random term: Denormalization (webglossary.info/random 🎲)