• Strings with only single-byte characters (e.g. ACSII text) have optimised path for Levenshtein, Restricted & Jaro. Reduced memory usage and ~20-60% faster.
• Strings with multi-byte characters have reduced memory usage for Levenshtein and Restricted.

• Damerau Levenshtein algorithm improvement (~15% faster)
• Use Slice for matrix rows (Levenshtein ~2% slower; Restricted ~25% faster; Damerau ~20% faster)
• Loosen type restriction for max arguments from Int32 to Int

• Type spec of parameters for integer Hamming loosened from Int32 | Int64 to Int
• Code quality/reflect language changes

Use // operator for integer division for compatibility with Crystal 0.31+

Adds RestrictedEdit.most_similar

• Adds thresholded version of Restricted Edit
• Performance improvements

• Thresholded Levenshtein remains bounded to max value when one string is blank
• Fix Ukkonen cut-off implementation 🏇

JaroWinkler.distance and JaroWinkler.similarity now have the same method signature.

Initial release 🎉