Javascript Disabled Detected

You currently have javascript disabled. Several functions may not work. Please re-enable javascript to access full functionality.

Soundex and levenstein distance algorithms

Started by Eusebio , Jul 20 2006 07:50 AM

Please log in to reply

2 replies to this topic

#1 Eusebio

Seeker

Active Members
18 posts

Posted 20 July 2006 - 07:50 AM

Anybody has implemented the soundex algorithm for autoIT? I'm insterested in levenstein distance algorithm, too.

Thanks,

Eusebio.

WhoIs YouTube Video downloader Soundex - SoundexEx - Levenshtein Distance (algorithms)I3oséAutoIT

Back to top

#2 Manadar

Taking a REST.

MVPs
10,714 posts

Posted 20 July 2006 - 07:57 AM

Soundex hasn't been. Us AutoIt users rather use the Windows alternative of speaking text (It's in v3 Scripts n Scraps.) Therefore Levenstein distance hasn't been used either.

Edit: Ofcourse, i don't know anything about any private projects that might have..

Edited by Manadar, 20 July 2006 - 07:58 AM.

josvanegmond.nl, /u/manadar24

Back to top

#3 Eusebio

Seeker

Active Members
18 posts

Posted 22 August 2006 - 10:15 AM

I've created functions if anybody are interested (any comments are welcome)

AutoIt

;..........................................................................................................................................
; This function returns an integer number which indicates the Levenshtein-Distance between the two
; argument strings or -1, if one of the argument strings is longer than the limit of 255 characters
; (255 should be more than enough for name or dictionary comparison).
;
; The Levenshtein distance is defined as the minimal number of characters you have to replace,
; insert or delete to transform sString1 into sString2.
;
; The greater the Levenshtein-Distance, the more different the strings are.
; Levenshtein-Distance is named after the Russian scientist Vladimir Levenshtein,
; who devised the algorithm in 1965.
; In its simplest form the function will take only the two strings as parameter and will calculate
; just the number of insert, replace and delete operations needed to transform sString1 into sString2.
;
; If you can't spell or pronounce Levenshtein, the metric is also sometimes called 'edit distance'.
; The Levenshtein distance algorithm has been used in:
; - Spell checking, - Speech recognition, - DNA analysis, - Plagiarism detection .
;
; Reference: [url=http://www.merriampark.com/ld.htm]http://www.merriampark.com/ld.htm[/url]
;
; I added some character 'cleaning' procedures prior to the specific Levenshtein algorithm.
;
; Eusebio Pérez Hurtado
;..........................................................................................................................................

Func _Levenshtein ($sString1, $sString2)
    $iStrLen1 = StringLen($sString1)
    $iStrLen2 = StringLen($sString2)

    If $iStrLen1=0 Then 
        Return ($iStrLen2)
    EndIf
    If $iStrLen2=0 Then 
        Return ($iStrLen1)
    EndIf

    If ($iStrLen1>255) Then Return (-1) ; see Note at end of function.
    If ($iStrLen2>255) Then Return (-1) ; see Note at end of function.

    ;..........................................................................................................................................
    ; Cleanup procedures, not quite necessary, but useful.
    $sString1 = StringUpper($sString1)
    $sString1 = _StringClean($sString1,"ÄÅÃÂÁÀ","A")
    $sString1 = _StringClean($sString1,"ËÊÉÈ"  ,"E")
    $sString1 = _StringClean($sString1,"ÏÎÍÌ"  ,"I")
    $sString1 = _StringClean($sString1,"ÒÓÔÕÖ" ,"O")
    $sString1 = _StringClean($sString1,"ÜÛÚÙ"  ,"U")
    $sString1 = _StringClean($sString1,"Ç","C")
    $sString1 = _StringClean($sString1,"Ñ","N")

    $sString2 = StringUpper($sString2)
    $sString2 = _StringClean($sString2,"ÄÅÃÂÁÀ","A")
    $sString2 = _StringClean($sString2,"ËÊÉÈ"  ,"E")
    $sString2 = _StringClean($sString2,"ÏÎÍÌ"  ,"I")
    $sString2 = _StringClean($sString2,"ÒÓÔÕÖ" ,"O")
    $sString2 = _StringClean($sString2,"ÜÛÚÙ"  ,"U")
    $sString2 = _StringClean($sString2,"Ç","C")
    $sString2 = _StringClean($sString2,"Ñ","N")

    $sString1 = _StringClean($sString1,"ABCDEFGHIJKLMNOPQRSTUVWXYZ","",2) ;OjO! aquí quito los numeros también
    $sString2 = _StringClean($sString2,"ABCDEFGHIJKLMNOPQRSTUVWXYZ","",2) ;OjO! aquí quito los numeros también
    ;..........................................................................................................................................

    ; The Levenshtein algorithm
    
    $iStrLen1 = StringLen($sString1)
    $iStrLen2 = StringLen($sString2)

    Dim $aArray [$iStrLen1+1][$iStrLen2+1]

    For $iRow=0 To $iStrLen1
       $aArray[$iRow][0] = $iRow
    Next

    For $iCol=0 To $iStrLen2
       $aArray[0][$iCol] = $iCol
    Next

    For $iRow=1 To $iStrLen1
       For $iCol=1 To $iStrLen2
          $iCost = StringMid($sString1,$iRow,1) <> Stringmid($sString2,$iCol,1)
          $iRowPrev = $iRow-1
          $iColPrev = $iCol-1
          $aArray[$iRow][$iCol] = _Min3(1+$aArray[$iRowPrev][$iCol],1+$aArray[$iRow][$iColPrev],$iCost+$aArray[$iRowPrev][$iColPrev])
       Next
    Next
    $iDistance = $aArray[$iStrLen1][$iStrLen2]

    Return ($iDistance)
EndFunc
oÝ÷ Ù«¢+Ø)Õ¹}5¥¸Ì ÀÌØí¸Ä°ÀÌØí¸È°ÀÌØí¸Ì¤(íIÑÕÉ¹ÌÑ¡5¥¹¥µÕ´½Ì¹ÕµÉÌ(íÕÍ¥¼AÉè!ÕÉÑ¼(ÀÌØíµ¥¸ÌôÀÌØí¸Ä(%ÀÌØí¸È±ÐìÀÌØíµ¥¸ÌQ¡¸ÀÌØíµ¥¸ÌôÀÌØí¸È(%ÀÌØí¸Ì±ÐìÀÌØíµ¥¸ÌQ¡¸ÀÌØíµ¥¸ÌôÀÌØí¸Ì(%IÑÕÉ¸ ÀÌØíµ¥¸Ì¤)¹Õ¹oÝ÷ Ù«¢+Ø(ì¸¸¸¸¸¸¸¸¸¸¸¸¸¸¸¸¸¸¸¸¸¸¸¸¸¸¸¸¸¸¸¸¸¸¸¸¸¸¸¸¸¸¸¸¸¸¸¸¸¸¸¸¸¸¸¸¸¸¸¸¸¸¸¸¸¸¸¸¸¸¸¸¸¸¸¸¸¸¸¸¸¸¸¸¸¸¸¸¸¸¸¸¸¸¸¸¸¸¸¸¸¸¸¸¸¸¸¸¸¸¸¸¸¸¸¸¸¸¸¸¸¸¸¸¸¸¸¸¸¸¸¸¸¸¸¸¸¸(ìM½Õ¹àµ¹¥ÁÕ±Ñ¥½¸Í½¸(ìT¹L¸AÑ¹ÑÌÄÈØÄÄØÜ ÄäÄà¤°ÄÐÌÔØØÌ ÄäÈÈ¤(ìä5ÉÉÐ,¸=±°¹I½ÉÐ¸IÕÍÍ°(ìÌÕÍäÑ¡9Ñ¥½¹°É¡¥ÙÌ¹I½ÉÌµ¥¹¥ÍÑÉÑ¥½¸¡9I¤(ì¡ÁÕ±¥Í¡ä½¸-¹ÕÑ m-¹ÕÑ¡t¤¸(ì(ìIÕÍÍ°ÌäíÌµÑ¡½¥ÌÕÍ±½È¹µÌÉ½´¹±¹°µÉ¥°ÝÍÑÉ¸ÕÉ½Á½Õ¹ÑÉ¥Ì°(ìÕÐ½Ì¹½ÐÁÁ±äÝ±°Ñ¼µ¹äM±Ù¥¹e¥¥Í ÍÕÉ¹µÌ(ì¹¥Ì¹½Ð¥¹Á¹¹Ð½ÍÙÉ°Ñ¡¹¥½¹Í¥ÉÑ¥½¹Ì¸(ì(ì]¥Ñ Í½Õ¹à°Ñ¡ÅÕ½ÐíÍ½Õ¹ÅÕ½Ðì½¹µÌ´Ñ¡Á¡½¹Ñ¥Í½Õ¹Ñ¼áÐ°¥Ì½¸(ìQ¡¥Ì¥Ì½ÉÐ¡±ÀÍ¥¹¥ÐÙ½¥Ìµ½ÍÐÁÉ½±µÌ½µ¥ÍÍÁ±±¥¹Ì½È±ÑÉ¹ÑÍÁ±±¥¹Ì¸(ì½ÈáµÁ±M¡Éµ¸°M¡ÕÉµ¸°M¡Éµ¸¹M¡¥Éµ¸¹M¡ÕÉµ¸É¥¹áÑ½Ñ¡ÈÌÅÕ½ÐíLØÔÔÅÕ½Ðì¸(ìMÕÉ¹µÍ½Õ¹à¥¹á¥¹¥Ì¹½Ð±Á¡Ñ¥°°ÕÐ¥Ì±¥ÍÑäÑ¡±ÑÑÈµ¹µ¹ÕµÈ½¸(ì%ÍÙÉ°ÍÕÉ¹µÌ¡ÙÑ¡Íµ½°Ñ¡¥ÈÉÌÉÉÉ¹±Á¡Ñ¥±±ää¥Ù¸¹µ¸(ìáµÁ±èLØÔÔÉÑ¡ÕÈ°LØÔÔ   ÑÍä°LØÔÔ
¡É±Ì¸(ì(ìIÕÍÍ±°M½Õ¹à9µµ5Ñ¡¥¹(ìQ¡IÕÍÍ±°M½Õ¹à
½±½É¥Ñ¡´¥ÌÍ¥¹ÁÉ¥µÉ¥±ä½ÈÕÍÝ¥Ñ ¹±¥Í ¹µÌ¹¥Ì(ìÁ¡½¹Ñ¥±±äÍ¹µµÑ¡¥¹µÑ¡½¸Q¡±½É¥Ñ¡´½¹ÙÉÑÌ ¹µÑ¼½ÕÈµ¡ÉÑÈ½°(ìÝ¡¥ ¸ÕÍÑ¼¥¹Ñ¥äÅÕ¥Ù±¹Ð¹µÌ°¹¥ÌÍÑÉÕÑÕÉÌ½±±½ÝÌm-¹ÕÑ¡tè(ìÄ¸IÑ¥¸Ñ¡¥ÉÍÐ±ÑÑÈ½Ñ¡¹µ°¹É½À±°½ÕÉÉ¹Ì½°° °¤°¼°Ô°Ü°ä¥¸½Ñ¡ÈÁ½Í¥Ñ¥½¹Ì¸(ìÈ¸ÍÍ¥¸Ñ¡½±±½Ý¥¹¹ÕµÉÌÑ¼Ñ¡Éµ¥¹¥¹±ÑÑÉÌÑÈÑ¡¥ÉÍÐè(ì°°À°ØôôÄ(ì°°¨°¬°Ä°Ì°à°èôôÈ(ì°ÐôôÌ(ì°ôôÐ(ì´°¸ôôÔ(ìÈôôØ(ìÌ¸%ÑÝ¼½Èµ½É±ÑÑÉÌÝ¥Ñ Ñ¡Íµ½ÝÉ©¹Ð¥¸Ñ¡½É¥¥¹°¹µ¡½ÉÍÑÀÄ¤ ÌÌìÌÌìÌÌì¤°(ì½µ¥Ð±°ÕÐÑ¡¥ÉÍÐ¸(ìÐ¸
½¹ÙÉÐÑ¼Ñ¡½É´E±ÑÑÈ°¥¥Ð°¥¥Ð°¥¥ÒHä¥¹ÑÉ¥±¥¹éÉ½Ì(ì¡¥Ñ¡ÉÉ±ÍÌÑ¡¸Ñ¡É¥¥ÑÌ¤°½ÈäÉ½ÁÁ¥¹É¥¡Ñµ½ÍÐ¥¥ÑÌ¥ÐÑ¡ÉÉµ½ÉÑ¡¸Ñ¡É¸(ì(ì½ÈáµÁ±°Ñ¡¹µÌÕ±È°ÕÍÌ°!¥±ÉÐ°-¹ÕÑ ¹1±½åÉ¥Ù¸Ñ¡ÉÍÁÑ¥Ù½Ì(ìÐØÀ°ÈÀÀ° ÐÄØ°,ÔÌÀ°0ÌÀÀ¸(ì!½ÝÙÈ°Ñ¡±½É¥Ñ¡´±Í¼¥ÙÌÑ¡Íµ½Ì½È(ì±±Éä°¡½Í °!¥±É½¹¸°-¹Ð¹1m-¹ÕÑ¡tÝ¡¥ É¹½ÐÉ±Ñ¥¸É±¥Ñä¸(ì(ìm-¹ÕÑ¡tè¸¸-¹ÕÑ °Q¡ÉÐ=
½µÁÕÑÈAÉ½Éµµ¥¹°Y½°¸Ì°M½ÉÑ¥¹¹MÉ¡¥¹°¥Í½¸]Í±ä°ÁÀÌäÄ´ÌäÈ¸(ì(ìÕÍ¥¼AÉè!ÕÉÑ¼(ì¸¸¸¸¸¸¸¸¸¸¸¸¸¸¸¸¸¸¸¸¸¸¸¸¸¸¸¸¸¸¸¸¸¸¸¸¸¸¸¸¸¸¸¸¸¸¸¸¸¸¸¸¸¸¸¸¸¸¸¸¸¸¸¸¸¸¸¸¸¸¸¸¸¸¸¸¸¸¸¸¸¸¸¸¸¸¸¸¸¸¸¸¸¸¸¸¸¸¸¸¸¸¸¸¸¸¸¸¸¸¸¸¸¸¸¸¸¸¸¸¸¸¸¸¸¸¸¸¸¸¸¸¸¸¸¸¸¸)Õ¹}M½Õ¹à ÀÌØíÍMÑÉ¥¹¤(%%MÑÉ¥¹1¸ ÀÌØíÍMÑÉ¥¹¤ôÀQ¡¸($%IÑÕÉ¸ ÅÕ½ÐìÅÕ½Ðì¤(%¹%($ÀÌØíÍMÑÉ¥¹ôMÑÉ¥¹UÁÁÈ ÀÌØíÍMÑÉ¥¹¤(($ìIÑ¥¸Ñ¡¥ÉÍÐ±ÑÑÈ½Ñ¡¹µ¸($ÀÌØíÍ
¡É¥ÉÍÐôMÑÉ¥¹5¥ ÀÌØíÍMÑÉ¥¹°Ä°Ä¤(($ìÍÁ¥°ÁÉµÁÉ½ÍÍ¥¹½ÈÉµ¸±¹Õ($ÀÌØíÍMÑÉ¥¹ôMÑÉ¥¹IÁ± ÀÌØíÍMÑÉ¥¹°ÅÕ½ÐíM
 ÅÕ½Ðì°ÅÕ½ÐíLÅÕ½Ðì¤ìÉµ¸ÍÁ¥°ÅÕ½ÐíÍ ÅÕ½Ðì($ÀÌØíÍMÑÉ¥¹ôMÑÉ¥¹IÁ± ÀÌØíÍMÑÉ¥¹°ÅÕ½Ðï|ÅÕ½Ðì°ÅÕ½ÐíLÅÕ½Ðì¤ìÉµ¸ÍÁ¥°Í¡ÉÀµÌÅÕ½Ðï|ÅÕ½Ðì(($ìÉ½À±°½ÕÉÉ¹Ì½°° °$°

Edited by Eusebio, 22 August 2006 - 10:32 AM.

WhoIs YouTube Video downloader Soundex - SoundexEx - Levenshtein Distance (algorithms)I3oséAutoIT

Back to top

Back to General Help and Support

0 user(s) are reading this topic

0 members, 0 guests, 0 anonymous users

Soundex and levenstein distance algorithms

#1 Eusebio

#2 Manadar

#3 Eusebio

0 user(s) are reading this topic

Sign In