levenshtein for large strings

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



.

Relevant Pages

  • Re: string-question
    ... as i promised earlier today i was intended to use the "levenshtein ... distance"-theory to determine the similarity of 2 strings ... ...
    (comp.lang.java.programmer)
  • Re: Comparing 2 sentences that are almost the same
    ... Check out the soundex() and levenshtein() functions. ... Alternatively split your strings in words in arrays and use ...
    (comp.lang.php)
  • Re: String matching/comparing, statistical similarity
    ... Chris Chris wrote: ... strings and get back a percentage of how similar the strings are? ... Anyway, Levenshtein ... distance is available: ...
    (comp.lang.ruby)
  • Re: Best Job Skill --> .NET or Java
    ... strings, ... But the same basic brute-force algorithm was ... It compiled a histogram of trigrams, ... finds one random trigram that is unique, it expands that one, ...
    (comp.programming)
  • Re: How to efficiently determine if a string contains any one of many strings
    ... If you are looking to apply an algorithm similar to determining what is ... the algorithm that is used in most heuristic spam filters. ... kinds of classifications lend themselves to searches for string literals: ... Of course, assuming more input strings to match, you'd have a lot more ...
    (microsoft.public.dotnet.languages.csharp)