aparler/RosettaCodeData
1
0
Fork 0
Code Issues 12 Pull requests 3 Projects Releases Packages Wiki Activity Actions

Data commit

Browse source
This commit is contained in:
Ingy döt Net 2023-07-01 11:58:00 -04:00
parent 7387c8f97b
commit cb5bb5e222
199093 changed files with 3378972 additions and 0 deletions
Download patch file Download diff file Expand all files Collapse all files

14
Task/Levenshtein-distance/ZX-Spectrum-Basic/levenshtein-distance.basic Normal file
View file

@ -0,0 +1,14 @@
10 REM ZX Spectrum Basic - Levenshtein distance
20 INPUT "first word:",n$
30 INPUT "second word:",m$
40 LET n=LEN n$:LET m=LEN m$:DIM d(m+1,n+1)
50 FOR i=1 TO m:LET d(i+1,1)=i:NEXT i
60 FOR j=1 TO n:LET d(1,j+1)=j:NEXT j
70 FOR j=1 TO n
80 FOR i=1 TO m
90 LET r=d(i,j)-(n$(j)=m$(i)):REM substitution
100 IF r>d(i,j+1) THEN LET r=r-1:REM insertion
110 LET d(i+1,j+1)=r+(r<=d(i+1,j)):REM deletion
120 NEXT i
130 NEXT j
140 PRINT "The Levenshtein distance between """;n$;""", """;m$;""" is ";d(m+1,n+1);"."