Calculate similarity between two strings using multiple algorithms like Levenshtein, Jaro-Winkler, and more
What is Levenshtein distance?
Levenshtein distance measures the minimum number of single-character edits (insertions, deletions, or substitutions) needed to transform one string into another.
What is Jaro-Winkler similarity?
Jaro-Winkler similarity gives higher scores to strings that match from the beginning. It is commonly used for name matching and record linkage.
What is the difference between Cosine and Jaccard similarity?
Cosine similarity uses character n-gram vectors and measures the angle between them, while Jaccard similarity compares word sets using intersection over union.
Is my data sent to a server?
No, all calculations are performed locally in your browser. Your text never leaves your device.
