Finds degree of similarity between two strings, based on Dice's Coefficient, which is mostly better than Levenshtein distance.
Update all dependencies to latest
compareTwoStrings(..)
: now O(n) instead of O(n^2)bestMatchIndex
to the results for findBestMatch(..)
to point to the best match in the supplied targetStrings
array