RiotTown has asked for the wisdom of the Perl Monks concerning the following question:
I'm in the process of putting some anti-fraud tools into place for my company. Part of this is to compare strings from an input form against those already existing within a database (all free form). IE, comparing "Steven Smith" to "Stephen Smithe" and "Steve Smith". This isn't limited to names right now, just makes for easier explaining.
I've got an algorithm and query already set up to return rows that are close to the user-input text, but I'm running into problems displaying exactly how similar the two strings are for ranking purposes.
Currently I'm testing with good results the Levenshtein Distance algorithm. The problem is that this method is SLOW, especially when comparing longer strings. (info can be found here on the Levenshtein Distance algorithm.
Does anyone know of a faster way to get a meaningful representation of how closely two stings match?
I've got an algorithm and query already set up to return rows that are close to the user-input text, but I'm running into problems displaying exactly how similar the two strings are for ranking purposes.
Currently I'm testing with good results the Levenshtein Distance algorithm. The problem is that this method is SLOW, especially when comparing longer strings. (info can be found here on the Levenshtein Distance algorithm.
Does anyone know of a faster way to get a meaningful representation of how closely two stings match?
Back to
Seekers of Perl Wisdom