[U2] Any code share for Levenshtein distance

Hi, Does anyone have any Basic code that implements the algorithm, Levenshtein distance? We are playing with words for a fraud detection project, trying discover bad guys better. TIA, -Baker Thanks for all the good discussions - I'm lurking and reading now and then. Others usually provide

Re: [U2] Any code share for Levenshtein distance

How hard can porting 20 lines of code be ? ;-) http://en.wikipedia.org/wiki/Levenshtein_distance -Original Message- From: u2-users-boun...@listserver.u2ug.org [mailto:u2-users-boun...@listserver.u2ug.org] On Behalf Of Baker Hughes Sent: Wednesday, April 17, 2013 1:39 PM To: U2 Users

Re: [U2] Any code share for Levenshtein distance

http://en.wikipedia.org/w/index.php?title=Levenshtein_distanceoldid=63073322 -Original Message- From: Baker Hughes baker.hug...@mouser.com To: U2 Users List (u2-users@listserver.u2ug.org) u2-users@listserver.u2ug.org Sent: Wed, Apr 17, 2013 10:39 am Subject: [U2] Any code share

Re: [U2] Any code share for Levenshtein distance

Note my link is to the page's ARCHIVE, which has about 20 different examples of code in various languages One of those should be better to trans into Pick BASIC, than the others. -Original Message- From: Wjhonson wjhon...@aol.com To: u2-users u2-users@listserver.u2ug.org Sent:

Re: [U2] Any code share for Levenshtein distance

After a little digging: Pick Basic IF STRING1 = STRING2 THEN LD = 0 END ELSE S.LEN = LEN(STRING1) C.LEN = LEN(STRING2) MAT LD.MTX = '' DIM LD.MTX(100,100) FOR I = 3 TO S.LEN + 2 LD.MTX(I,1) = STRING1[I-2,1]

Re: [U2] Any code share for Levenshtein distance

Proper attribution: http://en.wikibooks.org/wiki/Algorithm_Implementation/Strings/Levenshtein_distance#Pick_Basic Wjhonson wrote: Note my link is to the page's ARCHIVE, which has about 20 different examples of code in various languages One of those should be better to trans into Pick BASIC,

[U2] Levenshtein's distance algorithm

I got this from some other pick source and modified it a bit. *PROGRAM.TYPEUTILITY/PROGRAM.TYPELANGUAGE.CONVERTNO/LANGUAGE.CONVERTROLL.TO.DEAD.CODENO/ROLL.TO.DEAD.CODE $BASICTYPE 'U' SUBROUTINE GBH.STRING.DISTANCES( SOURCE.STRING, TARGET.STRING, CASE.INSENSITIVE, DISTANCE, MISC.IN.OUT, ERROR.MSG

Re: [U2] Levenshtein's distance algorithm

Thanks George. Looks like a very workable starting point. Thank you. -Baker x3598 -Original Message- From: u2-users-boun...@listserver.u2ug.org [mailto:u2-users-boun...@listserver.u2ug.org] On Behalf Of George Hammerle Sent: Wednesday, April 17, 2013 2:10 PM To:

Re: [U2] Any code share for Levenshtein distance

Thanks Jeff. I saw the wikibook and even scrolled through the examples but somehow missed the PickBasic example. Thank you. -Baker -Original Message- From: u2-users-boun...@listserver.u2ug.org [mailto:u2-users-boun...@listserver.u2ug.org] On Behalf Of Jeff Schasny Sent: Wednesday,

[U2] uvbackup linux command line - multiple specific files

Unix 'find' is failing me and I have not found documentation on specifically what I'm trying to do. I need to use uvbackup from the command line to back up 4 specific Universe files to one archive so they can be restored to a different platform without all the fnuxi stuff. I need to pick up the

Re: [U2] Any code share for Levenshtein distance

If this is something you take seriously, there are several other techniques you should use in conjunction with Levenshtein (I've done work in this area before). The first 3 you should also look at acronym and abbreviation matching (eg, UK = United Kingdom, abbr = abbreviation) as well as some

Re: [U2] Any code share for Levenshtein distance

Thanks for those insights Dan. Yes this is a serious matter due to increa$ing fraud activity. I saw the D-L variant on the wiki page and will take a look at that. We are currently using a metaphone and not very pleased but will look at the dbl metaphone. Thank you. -Baker -Original

[U2] AUTO: Brian Parker/NEMIAN is out of the office. (returning 22/04/2013)

I am out of the office until 22/04/2013. Note: This is an automated response to your message [U2] Any code share for Levenshtein distance sent on 4/17/2013 19:39:07. This is the only notification you will receive while this person is away. ___

Re: [U2] uvbackup linux command line - multiple specific files

cd to the directory where the files live then... find -maxdepth 1 -name 'BUY.[ST]MF*' -print | uvbackup Should get 'em. Perry -Original Message- From: u2-users-boun...@listserver.u2ug.org [mailto:u2-users-boun...@listserver.u2ug.org] On Behalf Of Jeff Schasny Sent: Wednesday,

Re: [U2] uvbackup linux command line - multiple specific files

hey, Another method, put the list of files to backup into a textfile, use the -cmdfil param of uvbackup cmd. Manu Perry Taylor perry.tay...@zirmed.com a écrit : cd to the directory where the files live then... find -maxdepth 1 -name 'BUY.[ST]MF*' -print | uvbackup Should get 'em.