YOU SAID:
In information theory, the Hamming distance between two strings of equal length is the number of positions at which the corresponding symbols are different. In other words, it 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. In a more general context, the Hamming distance is one of several string metrics for measuring the edit distance between two sequences.
INTO JAPANESE
等しい長さの 2 つの文字列間のハミング距離は、情報理論では、対応するシンボルが異なる位置の数です。言い換えれば、それは置換し、1 つの文字列を変更するために必要な最小数または、oth に 1 つの文字列を変換していることがエラーの最小数を測定します。
That's deep, man.