String Compare Library

Stable Version 1.0.0 (OutSystems 11)
Published on 8 Nov (11 days ago) by 
Created on 8 Nov (11 days ago)
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.

Reviews (0)
Libraries, Components
Support Options
This component is not supported by OutSystems. You may use the discussion forums to leave suggestions or obtain best-effort support from the community, including from J. who created this component.
String Compare Library has no dependencies.
Component Consumers
No consumers yet.
Weekly Downloads