字符串匹配算法

Question

Say I have 3 strings. And then 1 more string.
Is there an algorithm that would allow me to find which one of the first 3 strings matches the 4th string the most?
None of the strings are going to be exact matches, I'm just trying to find the closest match.
And if the algorithm already exists in STL, that would be nice.

Thanks in advance.

Answer 1

You don't specify what exactly you mean by "matches the most", so I assume you don't have precise requirements. In that case, Levenshtein distance in a reasonable metric. Simply compute the Levenshtein distance between each of the three strings and the fourth, and pick the one that gives the lowest distance.

Answer 2

You can implement the Levenshtein Distance algorithm, it provides a very nice measure of how close a match between two strings you have. It measures how many keystrokes you need to make in order to turn one string into the other. You can find a C++ implementation here .

Compute Levenshtein Distance between string #4 and the three strings that you have. Pick the string with the smallest distance.

Answer 3

There's nothing ready in the STL, but what you need is some kind of string metric.

• Use Levenshtein distance if the strings are similar up to some typos, eg Hello vs Helol .
• Use Jaccard distance / Dice's coefficient on the set of n-grams if the strings might change more drastically, like hello world versus world hello .

Answer 4

You have approximate string matching problem. Depending on what kind of matching you want to perform, you will use different algorithm. There are many.. SOUNDEX , Jaro-Winkler , Levenstein Distance , metaphore... etc. Regarding STL, I don't know any functions that implement those algorithms, but you can take a look here for some soource using c++. Also, note that if you are getting your strings from a database, it is very likely that your database engine implements some of those algorithms (most likely SOUNDEX).