THIS IS A PHONETIC ALGORYTHM
IT PRODUCES A {LEN=7} STRING CONSISTING OF FIRST INITIAL, 3 DIGIT CODE,
LAST INITIAL, AND 2 ZEROS FOR POSSIBLE DUPLICATION.
EXAMPLE: HENRY BOSCHEN {dats me} is B250H00
HAROLD BOUCHAN is perhaps B250H01
got the picture?
also included as a frebe is the incrementing subroutine which takes care of
duplicate indexes in ISAM.
THIS ALGORYTHM WONT HANDLE ALLLLLL MISSPELLINGS BUT A GOOD PHONETIC SPELLER
SHOULD BE ABLE TO FIND ANYONE IN THE FILE RATHER EASILY.
FOR FURTHER HELP OR HASSLES CALL 442 0522
2010 START:?TAB(-1,0);TAB(10,1);"ENTER THE LAST NAME: "
2020 ?:INPUT,LST'NM$:IF LST'NM$=" " THEN GOTO START
2040 ?:?"ENTER THE FIRST NAME:"
2050 FN:?TAB(16,1);:INPUT,FRST'NM$:IF FRST'NM$=" " THEN GOTO FN
2060 ALGORYTHM: LET L=2: LET ALGOR$="0000000": LET ALGOR$[1,1]=LST'NM$[1,1]
2070 FOR N=2 TO 15: LET P$=LST'NM$[N,N]
2080 IF P$="B" OR P$="P" OR P$="V" OR P$="F" THEN LET ALGOR$[L,L]="1"
2090 IF P$="S" OR P$="X" OR P$="Z" THEN LET ALGOR$[L,L]="2"
2100 IF P$="D" OR P$="T" THEN LET ALGOR$[L,L]="3"
2110 IF P$="L" THEN LET ALGOR$[L,L]="4"
2120 IF P$="M" OR P$="N" THEN LET ALGOR$[L,L]="5"
2130 IF P$="R" THEN LET ALGOR$[L,L]="6"
2140 IF ALGOR$[L,L]=0 THEN GOTO NEXT'N
2150 REM OTHERWISE ALGOR$[L,L]="0"
2160 SIMCHK: IF P$=LST'NM$[N+1,N+1] THEN GOTO INCREMENT
2170 GOTO INCR'L
2180 INCREMENT: LET N=N+1: IF N>21 THEN GOTO INCR'L
2190 GOTO SIMCHK
2200 INCR'L: LET L=L+1: IF L=5 THEN GOTO ADD'INITIAL
2210 NEXT'N: NEXT N
2220 ADD'INITIAL: LET ALGOR$[5,5]=FRST'NM$[1,1]
