Release 0.11.0

Changed

• improve OSA implementation

  • reduce runtime
  • reduce binary size by more than 25%

• reduce binary size of Levenshtein distance

• improve Damerau-Levenshtein implementation

  • reduce memory usage from O(N*M) to O(N+M)
  • reduce runtime in our own benchmark by more than 70%
  • reduce binary size by more than 25%

• only boost similarity in Jaro-Winkler once the Jaro similarity exceeds 0.7

Fixed

• Fix transposition counting in Jaro and Jaro-Winkler.
• Limit common prefix in Jaro-Winkler to 4 characters