"Looksalike" algorithm

11 Apr 2006 1:28 PM

almurph@altavista.com

Hi everyone,

I'm looking around for a VB.NET algorithm that can do non-exact
matches, that is, a "looks alike" type logic for word patterns.
Does anyone have any suggestions/comments/algorthms they would like
to mention? Any comments/suggestions greatly appreciated.

Al.

11 Apr 2006 1:52 PM

Patrice

I don't remember the name right now but I've seen once someone who had a
problem on an algorithm that finds the "edit distance" between two strings
(ie. the number of elementary insertion/deletion operations your have to do
to go from one string to the other one).

Googling for "edit distance" should hopefully return pages for this. you
still may want to explain what you are trying to do. The type of application
could raise more appropriate suggestions...

--
Patrice

<almu***@altavista.com> a écrit dans le message de news:
1144762127.852172.152***@j33g2000cwa.googlegroups.com...

Show quoteHide quote

> Hi everyone,
>
> I'm looking around for a VB.NET algorithm that can do non-exact
> matches, that is, a "looks alike" type logic for word patterns.
> Does anyone have any suggestions/comments/algorthms they would like
> to mention? Any comments/suggestions greatly appreciated.
>
> Al.
>

11 Apr 2006 2:12 PM

Patrice

This is the Levenshtein distance :
http://en.wikipedia.org/wiki/Levenshtein_distance

If I remember the poster had a problem with comparing similarity accross
couples of words (i.e. a 20 letter word with 4 changes is still "better"
than a 4 letter word with 3 changes). I suggested to divide the edit
distance by the length of the word to get a "number of changes per
letter"...

--
Patrice

"Patrice" <scr***@chez.com> a écrit dans le message de news:

uC0wr8WXGHA.4***@TK2MSFTNGP05.phx.gbl...
Show quoteHide quote

>I don't remember the name right now but I've seen once someone who had a
>problem on an algorithm that finds the "edit distance" between two strings
>(ie. the number of elementary insertion/deletion operations your have to do
>to go from one string to the other one).
>
> Googling for "edit distance" should hopefully return pages for this. you
> still may want to explain what you are trying to do. The type of
> application could raise more appropriate suggestions...
>
> --
> Patrice
>
> <almu***@altavista.com> a écrit dans le message de news:
> 1144762127.852172.152***@j33g2000cwa.googlegroups.com...
>> Hi everyone,
>>
>> I'm looking around for a VB.NET algorithm that can do non-exact
>> matches, that is, a "looks alike" type logic for word patterns.
>> Does anyone have any suggestions/comments/algorthms they would like
>> to mention? Any comments/suggestions greatly appreciated.
>>
>> Al.
>>
>
>

11 Apr 2006 3:03 PM

almurph@altavista.com

Merci Patrice.

Al.

11 Apr 2006 4:14 PM

Larry Lard

almu***@altavista.com wrote:

> Hi everyone,
>
> I'm looking around for a VB.NET algorithm that can do non-exact
> matches, that is, a "looks alike" type logic for word patterns.
> Does anyone have any suggestions/comments/algorthms they would like
> to mention? Any comments/suggestions greatly appreciated.

If you are doing fuzzy matching on names, something like Soundex might
help:

<http://en.wikipedia.org/wiki/Soundex>

Lots of stuff in there.

--
Larry Lard
Replies to group please

11 Apr 2006 5:52 PM

Ken Tucker [MVP]

Hi,

In addition to the other comments you can use option compare text to
make the string comparisons non case sensitive. Like works with string
comparsions. Finally regular expressions are great for matching patterns.
http://msdn.microsoft.com/library/default.asp?url=/library/en-us/cpref/html/frlrfsystemtextregularexpressionsregexclasstopic.asp

Ken
---------------------

Show quoteHide quote

"almu***@altavista.com" wrote:

> Hi everyone,
>
> I'm looking around for a VB.NET algorithm that can do non-exact
> matches, that is, a "looks alike" type logic for word patterns.
> Does anyone have any suggestions/comments/algorthms they would like
> to mention? Any comments/suggestions greatly appreciated.
>
> Al.
>
>

12 Apr 2006 1:43 PM

almurph@altavista.com

Thank you both for your comments