Sequential Edit DistANce

Performs a Levenshtein distance-like algorithm on some schema to identify the minimum number of single edits (insertions, deletions, or substitutions) needed to change one schema into another.