AutoHotkey Community

[polyethene]

Someone might find this useful, like I did...

Test cases:

[Jero3n]

What is DamerauLevenshteinDistance?

[polyethene]

It's an algorithm for calculating distance between strings by two guys called Damerau and Levenshtein. It lets you find matches based on proximity, which allows for human errors such as typos and spelling mistakes. In the example above "tihs" is 1 distance away from "this" so it's safe to assume the latter is implied, conversely "Toralf" and "Titan" are very far so it can be ignored. You can find more information on teh intarweb.
_________________
Chat (IRC) • PlusNet • Scripts • IronAHK • Contact by email not private message.

[Laszlo]

This function can be useful, although it is a simple (2-line) extension of the already posted Levenshtein_distance function, and does not compute the Damerau–Levenshtein distance, but the cost of the so-called optimal string alignment. You can verify it with

[Jero3n]

Than this is really usefull for an search function (what I want to implement in my application i'm writing at the moment), you can check it and when it has <2, I show something like: Did you meant ...

[polyethene]

[Laszlo]

[polyethene]

Calculating transportation in this sense is a lot quicker and accurate enough for most cases. In language semantics "ost" is a lot different from "to," I would expect it to have a closer relation to "lost" which the current Damerau extension ensures. As I said to Jero3n if you have a large index such as a dictionary it would be useful to rank about the deviation.
_________________
Chat (IRC) • PlusNet • Scripts • IronAHK • Contact by email not private message.

[Laszlo]

[polyethene]

Tomato, tomato it's all the same Laszlo
I haven't read Damerau's paper, but if he wrote an implementation that has this flaw I see no reason to rename it.

[Laszlo]

[polyethene]

[keybored]

Titan,
Did you change the code?

I have this in my message box;

[dormeu]

oh god.. this is so cool... exactly what i wanted...

adaptive searches ... also check the "hamming code" googleit!!

one problem with this though

distance 1 : script sc*ipt or whatever other errors in single chars are easy detectable, but i need something that ca also account for caracter substraction, or adition

ex : damerau dammerau = 4 and it should be 1 ( -eek!!)
ex: dammerau damerau this returns 1 - correct

So i take it the author was accounting that first is the haystack , and second is the needle ??

What about thinking outside the box? - the search should be unshure about the needle and the haystack
both permutation should return 1 becouse between the 2 only one operation was performed on either the needle or haystack

[hugov]

would making sure the needle is always the shortest string solve it, try this modify function with the new lines, it always returns 1 for me with your example