Levenshtein distance: Difference between revisions

(Added TypeScript Version)
Line 5,347:
11600 PROC _DLD_
11610 Result=0 : M=LEN(Word_1$) : N=LEN(Word_2$)
11620 FOR I=0 TO M : DLDm(I,10)=I : NEXT I
11630 FOR J=0 TO N : DLDm(10,J)=J : NEXT J
11640 FOR J=1 TO N
11650 FOR I=1 TO M