EDP edit distance

begin
    Top := k + 1;
    for I in 0 .. m loop H(I) := I; end loop;

    for J in 1 .. n loop
        C := 0;
        for I in 1 .. Top loop
            if P(I) = T(J) then E := C;
            else E := Min ((H(I - 1), H(I), C)) + 1; end if;
            C := H(I);
            H(I) := E;
        end loop;

        while H(Top) > k loop Top := Top - 1; end loop;

        if Top = m then Report-Match (J);
        else Top := Top + 1; end if;
    end loop;
end;