A utility class for finding the Levenshtein edit distance between strings.
Utility functions for dealing with Java naming conventions
The Needleman-Wunsch algorithm for finding least-cost string edit distances between pairs of strings.
A utility class for finding the distance between two identifiers.
Copyright © 2019. All rights reserved.