Do you have a question? Post it now! No Registration Necessary. Now with pictures!
- Posted on
- levenshtein for large strings
- Walter Kerelitsch
October 30, 2008, 9:18 pm
rate this thread
i need an algorithm for comparing two strings for equivalence, but
levenshtein is just working for strings up to 255 characters, i have to
process longer strings (lets say, about 10kB).
does anybody know a *simple* algorithm, which brings me the distance like
levenshtein (maybe not so exact than this)?
what do You think about the cost function of levenshtein, and with it to
adjust the strings and use levensthein for each single partitioned string?