ban Levenshtein <= 1 of common passwords

Mostly because many of the common passwords can be removed from the input as they are Levenshtein <= 1 of each other, also it broadens the set of bad passwords removed at very little cost thanks to fst.

No file, test, or entry point is named. Start by locating the Rust implementation that loads or filters common passwords and understand how the FST is used; then define the expected Levenshtein-distance behavior and add coverage showing which password variants are removed.

Written by the indexing model from the issue text.