Product Design, Manufacturing & Innovation Resources
Casa » Strumenti online » Strings Comparison Algorithms (or Strings Similarities)

Strings Comparison Algorithms (or Strings Similarities)

Nella codifica, quando si vuole essere più intelligenti che confrontare se 2 stringhe sono perfettamente uguali ("abc" == "abd" ? ) ... come quanto è diversa la prima stringa dalla seconda (come se l'utente ha inserito qualcosa con un errore di battitura), si ha la possibilità di scegliere tra diversi algoritmi, ognuno con pro e contro o fatto per casi speciali.

Well, this site is exactly for this: provide two sample strings and it will apply several algorithms and tell you the differences. Depending on the strings you want to identify,, in a couple of tests, you know the best algorithm and threshold to apply for your case. It tests all of these in one go and return a strings similarity percentage:

  • Levenshtein
  • NeedlemanWunch
  • Smith-Waterman
  • Smith-Waterman Gotoh
  • Smith-Waterman Gotoh Windowed Affine
  • Jaro
  • Jaro Winkler
  • QGrams Distance
  • Block Distance
  • Cosine Similarity
  • Distanza euclidea
  • Chapman Length Deviation
  • Overlap Coefficient

(some being directly integrated in your favorite language, some needed external libraries or be coded by you)

Note: the site is behind a bot-blocking wall, Cloudflare-like, annoying, but nothing very special (except the ugly screenshot for us)

Discipline: Informatica, scienza dei dati, bioinformatica, linguistica, ingegneria del software.
Free alternative to Diffchecker, Beyond Compare, Python difflib.
Strings Comparison Algorithms compared with Diffchecker, Beyond Compare and Python difflib
Strings Comparison AlgorithmsDiffcheckerBeyond ComparePython difflib
What it measures: The page takes two sample strings and runs 13 algorithms at once, returning a similarity percentage for each. You can then pick the algorithm and the threshold that fit your data.What it measures: The vendor describes core side-by-side comparison of two texts or files, plus Redline and folder or batch comparison on paid plans. The pricing page does not mention selectable similarity metrics.What it measures: The vendor describes comparison of folders, text files, images and tables, with syntax highlighting and comparison rules for documents and source code.What it measures: SequenceMatcher.ratio() returns a float between 0 and 1 computed as 2.0*M/T, where M is the number of matches and T the total number of elements in both sequences.
Algorithm basis: The list includes Levenshtein, Needleman-Wunsch, Smith-Waterman (with Gotoh variants), Jaro, Jaro-Winkler, q-grams, block distance, cosine similarity, Euclidean distance, Chapman length deviation and overlap coefficient. Edit-distance and alignment methods sit side by side.Algorithm basis: The matching method is described as a little fancier than the Ratcliff-Obershelp gestalt algorithm. The documentation does not mention Levenshtein distance.
Use in code: Some of the listed algorithms ship with common languages, while others need external libraries or your own implementation.Use in code: Separate API plans allow the comparison engine to be embedded in other applications.Use in code: A scripting language is offered to automate syncs.Use in code: It belongs to the Python standard library. get_close_matches(word, possibilities, n=3, cutoff=0.6) returns the best candidates. Worst-case time is quadratic, and strings of 200 or more items trigger an automatic junk heuristic that can be disabled with autojunk=False.
Licence, cost and platform: The page runs in the browser and sits behind a bot-blocking wall. A price or licence is not stated in the material available.Licence, cost and platform: The Basic plan is free with no file size limit, but many Pro features are capped at about 5 to 10 uses monthly. Pro with desktop app is a paid per-seat plan, and the desktop app runs on Windows, Mac and Linux.Licence, cost and platform: A per-user licence in Standard and Pro editions is a one-time purchase with no annual renewal fees. It runs on Windows, macOS and Linux and can be evaluated for free.Licence, cost and platform: No separate cost, since it ships with Python. The documentation is under the Python Software Foundation License Version 2.

Argomenti trattati: Confronto tra stringhe, similarità tra stringhe, Levenshtein, Needleman-Wunsch, Smith-Waterman, Jaro, Jaro-Winkler, distanza Q-gram, distanza a blocchi, similarità del coseno, distanza euclidea, deviazione di lunghezza di Chapman, coefficiente di sovrapposizione, algoritmo, soglia, percentuale di similarità, rilevamento di errori di battitura ISO/IEC 30170, ISO/IEC 24765, ISO/IEC 25010, ISO/IEC 25012 e ISO/IEC 25051.

Di più Codifica, Testo correlato strumenti

Suggerisci il tuo strumento online preferito:

Conosci un sito web migliore, complementare o sostitutivo di quello elencato sopra?

> Suggeriscilo qui <

decimo anno anniversario

Le immagini a grandezza naturale e i download sono disponibili, gratuitamente al 100%, solo per gli utenti registrati.

> Login <