The correction, coupled with unit insertion and deletion cost, guarantees that for an unrelated term pair a combination of insertion and deletion will always be less costly then a substitution.
in the computation of the optimal alignment, each operation cost ranges between 0 and 2.