Displaying 1 to 5 from 5 results

jaro-winkler - The Jaro-Winkler distance metric for node and browser.

  •    Javascript

A string similarity function using the Jaro-Winkler distance metric. Returns a number between 0 and 1. A 0 being no similarity and a 1 being an exact match. Read more about it on Wikipedia.

smetrics - String metrics library written in Go.

  •    Go

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.

StringDistances.jl - String Distances

  •    Julia

The function compare returns a similarity score between two strings. The function always returns a score between 0 and 1, with a value of 0 being completely different and a value of 1 being completely similar. Q-gram distances compare the set of all substrings of length q in each string.




levenshtein - Levenshtein distance and similarity metrics with customizable edit costs and Winkler-like bonus for common prefix

  •    Go

This package implements distance and similarity metrics for strings, based on the Levenshtein measure, in Go. v1.2.1 Stable: Guaranteed no breaking changes to the API in future v1.x releases. Probably safe to use in production, though provided on "AS IS" basis.






We have large collection of open source products. Follow the tags from Tag Cloud >>


Open source products are scattered around the web. Please provide information about the open source projects you own / you use. Add Projects.