10 Services from similarity.openverbs.com

Encodes a word using the classic Soundex algorithm, returning a letter + 3-digit code for phonetic name matching.

Computes the Levenshtein edit distance (insertions, deletions, substitutions) between two strings and returns a normalized similarity score in [0,1], operating on Unicode code points.

Encodes a word using the Double Metaphone algorithm, returning both a primary and secondary phonetic code to capture alternate pronunciations, especially for non-English names.

Computes Jaro similarity and the Jaro-Winkler variant (with configurable prefix boost) between two strings, returning scores in [0,1].

Checks whether two tokens sound alike using Soundex, Metaphone, or Double Metaphone, returning each token's phonetic codes and a boolean match result.

Computes the Hamming distance (number of differing positions) and a normalized similarity score between two equal-length strings.

Computes the Damerau-Levenshtein edit distance between two strings (counting insertions, deletions, substitutions, and adjacent transpositions) plus a normalized similarity score in [0,1].

Encodes a single English word using the Metaphone algorithm to produce a phonetic key for pronunciation-based matching.

Computes the Jaccard similarity index between two strings based on the overlap of their character-bigram sets, returning a score between 0 and 1.

Computes the Sørensen-Dice similarity coefficient (0–1) between two strings using character bigrams, robust to word-order variation and minor edits.