search

ajmalsiddiqui / levenshtein-diff

A fast, generic implementation of Levenshtein's Algorithm for any kind of sequence, along with the ability to generate edits and regenerate the target sequence by applying edits to the source sequence.
MIT License
8 stars 3 forks source link

issues

Newest
Newest Most commented Recently updated Oldest Least commented Least recently updated