We have collection of more than 1 Million open source products ranging from Enterprise product to
small libraries in all platforms. We aggregate information from all open source repositories.
Search and find the best for your needs. Check out projects section.
This library contains implementations of the Levenshtein distance, Jaro-Winkler and Soundex algorithms written in Go (golang). Other algorithms related with string metrics (or string similarity, whatever) are welcome. The Wagner-Fischer algorithm for calculating the Levenshtein distance. It runs on O(mn) and needs O(2m) space where m is the size of the smallest string. This is kinda optimized so it should be used in most cases.
You can change the version in the url to see the documentation for an older version in the changelog. If you don't want to install Rust itself, you can run $ ./dev for a development CLI if you have Docker installed.
strutil provides string metrics for calculating string similarity as well as other string utility functions. Full documentation can be found at: https://pkg.go.dev/github.com/adrg/strutil. The package defines the StringMetric interface, which is implemented by all the string metrics. The interface is used with the Similarity function, which calculates the similarity between the specified strings, using the provided string metric.
TySug is collection of packages, together they form a keyboard layout aware alternative word suggester. It can be used as both a library and a webservice. The primary supported use-case is to help with spelling mistakes against short popular word lists (e.g. domain names). Which is useful in helping to prevent typos in e.g. e-mail addresses, detect spam, phishing (Typosquatting), etc.