From this, we take the nearest neighbor w Kur for each w Sor , and calculate the edits for this pair.
for example, for the pair ⟨bɾiːtanja, bɾi:tanija⟩, the edits would be ⟨b,b⟩, 10 to say, if we consider the "perfect" metric that we are seeking m * , and our naïve initial metric m0 (in this case, an unweighted Levenshtein distance), there exists some threshold constant t such that every nearest neighbor of a word w according to m * is within t distance of w according to m0.