Skip to content

An implementation of the Levenshtein algorithm in Go. Provides edit distances and edit scripts.

License

Notifications You must be signed in to change notification settings

danieldk/editdistance

 
 

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 

History

25 Commits
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 

Repository files navigation

editdistance

Introduction

This is an experimental Go package that aims to make Kilian Evang's golang-levenshtein package generic in both:

  • The edit operations, making it possible to use different distance measures (e.g. shortest edit script, Levenshtein distance, Levenshtein-Damerau distance).
  • The sequence (element) type (e.g. characters, tokens, nucleotides).

Since Go does not support parametric polymorphism, one of the goals is to evaluate how much genericity is possible without too much performance loss.

About

An implementation of the Levenshtein algorithm in Go. Provides edit distances and edit scripts.

Resources

License

Stars

Watchers

Forks

Releases

No releases published

Packages

No packages published

Languages

  • Go 100.0%