Clone this repo:

Branches

  1. 1a14278 Merge branch 'keegancsmith-master' by Kilian Evang · 2 months ago master
  2. a25f4c2 Also test DistanceForMatrix(MatrixForStrings()) by Keegan Carruthers-Smith · 3 months ago
  3. 4041401 A more detailed implementation comment by Keegan Carruthers-Smith · 3 months ago
  4. 3f81297 Remove source and target swap by Keegan Carruthers-Smith · 3 months ago
  5. ead36ec Memory efficient for DistanceForStrings by Keegan Carruthers-Smith · 3 months ago

golang-levenshtein

An implementation of the Levenshtein algorithm in Go. Provides edit distances, edit scripts and ratios for strings (slices of runes).

For a package that is similar but more generic and provides more control, check out Daniël de Kok’s editdistance.