I've looked everywhere for a good explanation of an algorithm for fuzzy string matching. Anyone have a link to a good tutorial on it?
Thanks,
Shane
I've looked everywhere for a good explanation of an algorithm for fuzzy string matching. Anyone have a link to a good tutorial on it?
Thanks,
Shane
lol.
If you've looked everywhere, where are we supposed to look?
Mainframe assembler programmer by trade. C coder when I can.
If you dance barefoot on the broken glass of undefined behaviour, you've got to expect the occasional cut.
If at first you don't succeed, try writing your phone number on the exam paper.
Sorry for the brevity of my initial post. I was in a bit of a rush when I wrote it. It makes me sound as if I'm looking for you to do the searching for me, which isn't the case.
That's kind of along the lines of what I was looking for, but I was more thinking of something where I could find a percent of similarity between two strings...Originally Posted by Salem
Say, for instance, that I compare the strings "how are you?" and "how do you do?". I'm looking for an algorithm that could tell me whether the two strings have a roughly matching meaning in the form of a percentage... Do you understand what I'm asking for? Anyone have any ideas?
It all depends on how you want to match the two strings:
Character matching:
"how are you?" and "how do you do?" - about 50% similarity. While strings are the same, count "similar". If strings differ, use some method to find a similar point again.
Word-wise:
Roughly the same as character matching, but instead of matcing characters, parse the string and split into words, and compare words.
The difference between character and word matching omes when matching something like:
"How do you do?"
with
"Howling on you?" [Sorry, silly example, but had to come up with something starting with "How..."]
Linguistically:
"how are you?" and "how do you do?" - not much in common at all (one is asking a genuine question, the other is a formality in greething someone - and no one is genuinely interested in either case]. This is of course much more complicated than the method of word or character matching, because it has to do with the meaning of the words.
--
Mats
Compilers can produce warnings - make the compiler programmers happy: Use them!
Please don't PM me for help - and no, I don't do help over instant messengers.
Soundex returns a number (of sorts), converting it to a %'age can't be that hard surely.
If you dance barefoot on the broken glass of undefined behaviour, you've got to expect the occasional cut.
If at first you don't succeed, try writing your phone number on the exam paper.
