String Compare Library

Stable Version 1.0.0 (Compatible with OutSystems 11)
Published on 08 November 2019 by 
0.0
 (0 ratings)

String Compare Library

Details
Compare two texts and return a value how similar they are. Methods implemented: - Basic (is it the same or not) - Levenshtein Method
Read More

When you want to find duplicates or candidates of duplicates it's not easy to solve.

Therefor there are some methods invented to give a nice idea if two string match or not.

One method is the Levenshtein Method:

The 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. It is named after the Soviet mathematician Vladimir Levenshtein, who considered this distance in 1965.

What’s new (1.0.0)
Reviews (0)