By using this site, you agree to our updated Privacy Policy and our Terms of Use. Manage your Cookies Settings.
437,890 Members | 1,050 Online
Bytes IT Community
+ Ask a Question
Need help? Post your question and get tips & solutions from a community of 437,890 IT Pros & Developers. It's quick & easy.

levenshtein for large strings

P: n/a
hi folks,

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?

tia walter

Oct 30 '08 #1
Share this Question
Share on Google+
2 Replies


P: n/a
Walter Kerelitsch wrote:
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).
The Levenshtein algorithm has no limit in length. Your problem is probably
that PHP limits the length. Just implement the algorithm yourself. How it
works you can see e.g. on wikipedia:
http://en.wikipedia.org/wiki/Levenshtein_distance
Oct 31 '08 #2

P: n/a

"Boris Stumm" <st***@informatik.uni-kl.deschrieb im Newsbeitrag
news:ge**********@news.uni-kl.de...
The Levenshtein algorithm has no limit in length. Your problem is probably
that PHP limits the length. Just implement the algorithm yourself. How it
yes, exactly, PHP limits...
thanks a lot for your hint, danke

greetings walter

Oct 31 '08 #3

This discussion thread is closed

Replies have been disabled for this discussion.