Levenshtein distance: Difference between revisions
m
→Iterative implementation (Wagner-Fischer algorithm): other typos
m (→{{header|RPL}}: typo) |
m (→Iterative implementation (Wagner-Fischer algorithm): other typos) |
||
Line 5,680:
DUP2 { } + + ≪ SIZE ≫ DOLIST 1 ADD 0 CON → a b d
≪ 1 a SIZE '''FOR''' h
'd' h 1 + 1 2 →LIST h PUT '''NEXT'''
1 b SIZE '''FOR''' j
'd' 1 j 1 + 2 →LIST j PUT '''NEXT'''
1 b SIZE '''FOR''' j
1 a SIZE '''FOR''' h
Line 5,701 ⟶ 5,700:
for j from 1 to n:
d[0, j] := j
for j from 1 to n:
for h from 1 to m:
|