Release 1.6.0

Changed

• fuzz.partial_ratio uses a new implementation for short needles (<= 64). This implementation is
  • more accurate than the current implementation (it is guaranteed to find the optimal alignment)
  • it is significantly faster
• Add process.cdist to compare all elements of two lists (see #51)

Release 1.5.1

Fixed

• Fix out of bounds access in levenshtein_editops

Release 1.5.0

Changed

• all scorers do now support similarity/distance calculations between any sequence of hashables. So it is possible to calculate e.g. the WER as:

>>> string_metric.levenshtein(["word1", "word2"], ["word1", "word3"])
1

Added

• Added type stub files for all functions
• added jaro similarity in string_metric.jaro_similarity
• added jaro winkler similarity in string_metric.jaro_winkler_similarity
• added Levenshtein editops in string_metric.levenshtein_editops

Fixed

• Fixed support for set objects in process.extract
• Fixed inconsistent handling of empty strings

Release 1.4.1

Performance

• improved performance of result creation in process.extract

Fixed

• Cython ABI stability issue (#95)
• fix missing decref in case of exceptions in process.extract

Release 1.4.0

Changed

• added processor support to levenshtein and hamming
• added distance support to extract/extractOne/extract_iter

Fixed

• incorrect results of normalized_hamming and normalized_levenshtein when used with utils.default_process as processor

Release 1.3.3

Fixed

• Fix a bug in the mbleven implementation of the uniform Levenshtein distance and cover it with fuzz tests

Release 1.3.2

Fixed

• some of the newly activated warnings caused build failures in the conda-forge build

Release 1.3.1

Fixed

• Fixed issue in LCS calculation for partial_ratio (see #90)
• Fixed incorrect results for normalized_hamming and normalized_levenshtein when the processor utils.default_process is used
• Fix many compiler warnings

Release 1.3.0

Changed

• add wheels for a lot of new platforms
• drop support for Python 2.7

Performance

• use is instead of == to compare functions directly by address

Fixed

• Fix another ref counting issue
• Fix some issues in the Levenshtein distance algorithm (see #92)

Release 1.2.1

Performance

• further improve bitparallel implementation of uniform Levenshtein distance for strings with a length > 64 (in many cases more than 50% faster)