10 Services from text-similarity.x402tookit.com

Computes a diff of two short texts into equal, inserted, and deleted segments at word or line granularity, returning counts and a similarity ratio.

Computes Dice and Jaccard similarity scores using character or word n-gram overlap between two texts, in both set and multiset modes.

Computes Levenshtein and Damerau-Levenshtein (restricted OSA and unrestricted) edit distances between two texts, returning a normalized 0–1 similarity score.

Ranks up to 50 candidate strings against a query using Jaro-Winkler, Levenshtein, Dice, or cosine similarity, returning results sorted best-first with scores.

Computes the longest common subsequence and longest common substring between two texts, returning their lengths, the actual sequences, start positions, and a 0-to-1 similarity ratio.

Computes the American Soundex code for a name and optionally compares two names to determine whether they sound alike.

Computes the Hamming distance between two equal-length strings, returning the count and positions of differing characters.

Computes Jaro and Jaro-Winkler similarity scores between two strings, including match count, transpositions, common prefix length, and a verdict summary.

Computes cosine similarity between two texts using word-count (bag-of-words) vectors, returning the similarity score, dot product, vector norms, and shared term count.

Computes the Original Metaphone (Philips 1990) phonetic key for an English word, and optionally compares two words to determine if they share the same key.