Best way string-matching algorithm for same-length strings? -
I need to implement string-mailing algorithm, to determine which wire will be the closest match. I think humming distance is a good matching algorithm, when this fixed-length is attainable.
If I want to use the Levenschatin distance formula, then what is the benefit of matching quality? I know that this method is less efficient, given that it is for variable-length strings, but I really belong here to the quality of matches. Besides, is there any better algorithm that might want to consider there? ? I work in java, if there are any differences.
Many thanks
Levenshatan distance 2. Hamming distance (working on characters instead of bits) is 7.
So it really depends on whether you treat those stars as like Whether or not it has fair use in the distance of hamming, but "do these strings look like a human?" Is not one of them.
Comments
Post a Comment