http://bugzilla.spamassassin.org/show_bug.cgi?id=2878
------- Additional Comments From [EMAIL PROTECTED] 2004-01-04 17:35 ------- I was a little sloppy when I wrote O(n^2), what I meant was, that if you have two texts M and N of lengths m and n, then the running time is O(nm), if both texts are of almost equal size it's something like O(nn) = O(n^2). The Normalized Edit Distance (NED) (as opposed to Edit Distance (ED) aka Levenshtein Distance) has a best known implementation running time of O(m*n^2) which is worse than O(m*n) for ED. I'm not sure if the NED is any advantage if you just assign the edits a weight of 1 each. You could make a Edit Distance relative to length by just dividing the ED by the length of one of the strings or of the average length of both strings. ------- You are receiving this mail because: ------- You are the assignee for the bug, or are watching the assignee.
