On Wed, Jan 26, 2005 at 07:37:02PM +0800, GUO Zhijun wrote:
I'm working on a problem. I found buddy wearing
final, so cool!). So I post it here thinking maybe you can give me
some hints. It's described as following: Given a string and a pool
of strings, find which string in pool is best matched the given one.
I know I can use dynamic programming to find out the largest common
substring of two strings.
But how to apply on my problem?
I've looked at something like this before in the past. The terms you
want to look for are "string edit distance" or "Levenshtein" on
a google search. Basically it gives a score for how many additions
and deletions are required to turn one string into another.