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
@listserver.u2ug.org
Subject: [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