Levenshtein distance is a string metric for measuring the difference between two sequences. Informally, the Levenshtein distance between two words is the minimum number of single-character edits (insertions, deletions or substitutions) required to change one word into the other.
Text similarity is calculated based on Levenstein distance and length iof source/target texts.
Please support us by sharing this project
♡ You are the best ♡