Damerau-Levenshtein distance

Checks and payment terms on this page refer to the endpoint above. Other listed endpoints have not been checked individually.

Base URLhttps://similarity.openverbs.com/v1

• POST/compare$0.002Report whether two tokens sound alike under a chosen algorithm (soundex, metaphone or double-metaphone; default double-metaphone). Returns each token's codes and a boolean match.
• POST/soundex$0.002Encode a word with the classic Soundex algorithm (letter + 3 digits) for phonetic matching of names.
• POST/jaro$0.004Jaro similarity and the Jaro-Winkler variant (which boosts scores for a shared prefix), both in [0,1]. The prefix boost factor is configurable (default 0.1, max 0.25). Well suited to short strings like names.
• POST/dice$0.004Sørensen-Dice similarity coefficient in [0,1] over character bigrams — robust to word order and minor edits.
• POST/hamming$0.004Hamming distance — the number of positions at which two EQUAL-LENGTH strings differ — plus a normalized similarity. Strings of unequal length are a clean 400.
• POST/levenshtein$0.004Levenshtein edit distance (insertions, deletions, substitutions) between two strings, plus a normalized similarity in [0,1]. Operates on Unicode code points.
• POST/double-metaphone$0.002Encode a word with Double Metaphone, returning a primary and a secondary code to capture alternate pronunciations (useful for non-English names).
• POST/metaphone$0.002Encode a word with the Metaphone algorithm — more accurate than Soundex for English pronunciation.
• POST/damerau$0.004Damerau-Levenshtein distance — like Levenshtein but also counts adjacent transpositions as a single edit — plus a normalized similarity in [0,1].
• POST/jaccard$0.004Jaccard similarity index in [0,1] — the size of the intersection over the union of the two strings' character-bigram sets.

A dash means the listing gives no price or method. Copy buttons copy the full URL.

Showing 10 of 10 listed endpoints.