Quickenshtein

Making the quickest and most memory efficient implementation of Levenshtein Distance with SIMD and Threading support

MIT License

Stars

273

Ecosystems: C#

Statistics for this project are still being loaded, please check back later.

Badges

Extracted from project README

Linq-like extension functions for Arrays, Span<T>, and List<T> that are faster and allocate less.

The fastest .Net Levenshtein around

Test system for comparing code performance.

High performance LINQ implementation with minimal heap allocations. Supports enumerables, async e...