# Tag Info

### Damerau-Damerau distance

MATL, 5 4 bytes -20% thanks to Luis Mendo! &<Rz Try it online! or Verify all cases! As long as the list is not sorted, there is always an adjacent pair that ...
• 59.5k

### Levenshtein Distance

APL (Dyalog Classic), 34 bytes {0∊≢¨⍵:≢∊⍵⋄⌊/(≢.↑+∘∇↓¨)∘⍵¨1↓,⍳2 2} Try it online!
• 15.3k

### Damerau-Damerau distance

Factor + koszul, 10 bytes inversions Try it online!
• 24.6k

### Count the size of the Levenshtein neighborhood

Rust, score ≈ (28, 23) The number of strings at distance $k$ from $s$ with some given prefix $p$ is a function of $s$, $k$, and the last column of the Wagner–Fischer table of $s$ and $p$....
• 39.7k

### Find the minimum edit distance between two strings

Brachylog (v2), 14 bytes ⟨⊇⊆⟩jg;?clᵐ-ˡṅ Try it online! This question has a surprising lack of golfing language solutions (there's an APL solution, which is a quasi-...

• 98.8k

### Damerau-Damerau distance

R, 38 bytes function(x)sum(combn(c(0,x),2,diff)<0) Try it online! Adaptation of ovs's answer. Test harness taken from Dominic van Essen's answer. ...
• 28.6k

### Find The Average String Between Two Strings

Vyxal, 14 bytes Þ∪Þx:ƛ□꘍GN;ÞMİ Try it Online! I think Þ∪ can be J, but that makes it so ...
• 12.5k

### Pick a random string at a fixed edit distance

Python, 3453 bytes ...
• 3,301

### Levenshtein distance & OEIS (Cops)

Haskell, LD = 13, cracked ((snd.span(<'1').reverse.show.(^2)=<<[1..])!!) Try it online! I double-checked that leading zeros are trimmed ;) ...
• 26.2k