Skip to content

Releases: rapidfuzz/RapidFuzz

Release 1.9.0

11 Dec 19:27
Compare
Choose a tag to compare

Fixed

  • Fix some issues in the type annotations (see #163)

Performance

  • improve performance and memory usage of rapidfuzz.string_metric.levenshtein_editops
    • memory usage is reduced by 10x
    • performance is improved from O(N * M) to O([N / 64] * M)

Release 1.8.3

19 Nov 09:29
Compare
Choose a tag to compare

Added

  • Added missing wheels for Python3.6 on MacOs and Windows (see #159)

Release 1.8.2

27 Oct 12:08
Compare
Choose a tag to compare

Added

  • Add wheels for Python 3.10 on MacOs

Release 1.8.1

21 Oct 17:46
Compare
Choose a tag to compare

Fixed

  • Fix incorrect editops results (See #148)

Release 1.8.0

20 Oct 14:39
Compare
Choose a tag to compare

Changed

  • Add Wheels for Python3.10 on all platforms except MacOs (see #141)
  • Improve performance of string_metric.jaro_similarity and string_metric.jaro_winkler_similarity for strings with a length <= 64

Release 1.7.1

02 Oct 09:38
Compare
Choose a tag to compare

Fixed

  • fixed incorrect results of fuzz.partial_ratio for long needles (see #138)

Release 1.7.0

27 Sep 15:17
1ec62d5
Compare
Choose a tag to compare

Changed

  • Added typing for process.cdist
  • Added multithreading support to cdist using the argument process.cdist
  • Add dtype argument to process.cdist to set the dtype of the result numpy array (see #132)
  • Use a better hash collision strategy in the internal hashmap, which improves the worst case performance

Release 1.6.2

15 Sep 07:38
Compare
Choose a tag to compare

Changed

  • improved performance of fuzz.ratio
  • only import process.cdist when numpy is available

Release 1.6.1

11 Sep 10:27
Compare
Choose a tag to compare

Changed

  • Add back wheels for Python2.7

Release 1.6.0

10 Sep 13:17
802c2f3
Compare
Choose a tag to compare

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)