levenshtein-ffi

BSD-2-ClauseRuby

151 stars29 forks0 contributors

Overview

Fast string edit distance computation, using the Damerau-Levenshtein algorithm.

Community-curated · Updated weekly · 100% open source

Open-Awesome is built by the community, for the community. Submit a project, suggest an awesome list, or help improve the catalog on GitHub.

2 years ago

CreatedSince 2010

Auto-fetched 1 day ago

Ruby gem to calculate the similarity between texts using tf*idf

Approximate String Matching library

Calculates edit distance using Damerau-Levenshtein algorithm

Fast Ruby FFI string edit distance algorithms