I need to compare strings to decide whether they represent the same thing. This relates to case titles entered by humans where abbreviations and other small details may differ. For example, consider the following two titles:
std::string first = "Henry C. Harper v. The Law Offices of Huey & Luey, LLP";
As opposed to:
std::string second = "Harper v. The Law Offices of Huey & Luey, LLP";
A human can quickly gauge that these are most likely one and the same. The current approach I have taken is to normalize the strings by lowercasing all letters and removing all punctuation and spaces giving:
std::string firstNormalized = "henrycharpervthelawofficesofhueylueyllp";
And:
std::string secondNormalized = "harpervthelawofficesofhueylueyllp";
Comparing in this case, one is a sub-sequence of the other, but you can imagine other more complex variations where that does not necessarily occur, yet they have significant sub-sequences in common. There could also be occasional human entry errors such as transposed letters and spelling errors.
Perhaps some kind of character diff program could help? I've seen good line diff programs for comparing differences in code to be checked in, is there something like that on a character basis, maybe in boost? If you could count the number of consecutive characters in common and take the ratio to the characters unshared, perhaps that would be a good heuristic?
In the end, I need a Boolean decision as to whether to consider them the same or not. It doesn't have to be perfect, but it should ideally rarely be wrong.
What algorithm can I use that will give me some kind of quantification as to how similar the two strings are to each other which I can then convert into a yes/no answer by way of some heuristic?
What you're looking for are called String Metric algorithms. There a significant number of them, many with similar characteristics. Among the more popular:
Have a look at these as well as others on the wiki page on the topic.