Timeline for Using Levenshtein distance to compare strings
Current License: CC BY-SA 4.0
5 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Jan 19, 2020 at 12:47 | history | edited | greybeard | CC BY-SA 4.0 | Levenstein -> Levenshtein |
| Feb 7, 2013 at 19:27 | comment | added | tb- | Do not use harsh words, at least you got some other thoughts, which is always fine. If you experiment with the algorithm, you should create some unit tests. I did some trivial cases for me, too. But you have some real data which makes an advantage. | |
| Feb 7, 2013 at 19:20 | vote | accept | KDecker | ||
| Feb 7, 2013 at 19:19 | comment | added | KDecker | I apologize for the poor coding practices (naming, logical errors, bad syntax). When I initially started on this I never thought I might use it more than once. I then got caught trying to write the code as I was using it, thus the piss poor coding. --- Thank you for the extended response, This seems that it will work much better than my current implementation. I will try it later today when i get back home. Thanks tb-!!!! | |
| Feb 7, 2013 at 18:58 | history | answered | tb- | CC BY-SA 3.0 |