A
almurph
Hi,
Hope you can help me with this one. I'm looking for some nice string
comparison algorithms. I want to be able to compare 2 strings (fairly
smallish, less than 50 characters) and return a % of how well they are
similar. So, 2 strings that are absoloutly identical will return 100%.
Strings that are radically different will return numbers near 0%:-
Tokenistic Examples:
String1 String2 % Comnparison
Albatross Car 5
Car Car 100
I would appreciate any
comments/code-samples/suggestions/user-experiences that you may have...
Thanks in advance,
Al.
PS: I already have implemented Lavenstein distance, so no worries there.
Hope you can help me with this one. I'm looking for some nice string
comparison algorithms. I want to be able to compare 2 strings (fairly
smallish, less than 50 characters) and return a % of how well they are
similar. So, 2 strings that are absoloutly identical will return 100%.
Strings that are radically different will return numbers near 0%:-
Tokenistic Examples:
String1 String2 % Comnparison
Albatross Car 5
Car Car 100
I would appreciate any
comments/code-samples/suggestions/user-experiences that you may have...
Thanks in advance,
Al.
PS: I already have implemented Lavenstein distance, so no worries there.