As Nicolas Delfosse (is he on here?) points out, erasure errors are easier to correct than Pauli errors. Viderman's algorithm is akin to UNION FIND in that it converts a Pauli error to an erasure. However, Viderman's algo is fine tuned for codes that are expand-y.