Releases: Turnerj/Quickenshtein
Releases · Turnerj/Quickenshtein
1.5.1
23 May 07:10
Compare
Sorry, something went wrong.
No results found
Fixes MissingMethodException relating to .NET Standard 2.0 string variants of GetDistance (#45 , #46 )
1.5.0
14 Jun 13:40
Compare
Sorry, something went wrong.
No results found
Performance Improvements
Support for 16-bit (ushort) diagonal calculations (#20 ) - approximately 15% faster under certain workloads
Improving pointer handling for diagonal calculations (d6ef6d4 ) - approximately 8% faster
Improving end-of-string trimming performance (c7be0ac ) - approximately 5% faster
1.4.0
03 May 08:10
Compare
Sorry, something went wrong.
No results found
Performance Improvements
Replaced primary .NET Core implementation with new Diagonal Levenshtein Calculation, based on Anna Henningsen 's C implementation of Levenshtein Distance - approximately 40% faster than previous
Faster sequential filling for non-diagonal calculations - approximately 20-40% faster than previous
1.3.0
05 Apr 05:30
Compare
Sorry, something went wrong.
No results found
Performance Improvements
Up-to 8x outer loop unrolling (.NET Core)
Multi-threading support (.NET Core & .NET Framework)
Minor other performance improvements (.NET Core)
1.2.0
18 Feb 12:34
Compare
Sorry, something went wrong.
No results found
Performance Improvements & Bug Fixes
Smarter handling of vectors during row calculation (.NET Core)
Fixed bug in intrinsic trimming (.NET Core)
Unrolling outer row loop (.NET Core & .NET Framework)
Note: This version is the first correctly calculating version after version 1.1.0 and 1.1.1 had issues. Additional tests have been added to hopefully mitigate this from happening again in the future.
1.0.0
06 Feb 10:03
Compare
Sorry, something went wrong.
No results found
Initial release of Quickenshtein
Supports AVX2 and SSE2 intrinsics for some operations
Zero allocations in both .NET Framework and .NET Core
Various optimizations including equality trimming