⚡⚡ A lightning-fast implementation of the Levenshtein distance algorithm.
Written in AssemblyScript, compiled to WebAssembly, and optimized for speed.
0 dependencies
Based on fastest-levenshtein by ka-weihe.
-
Notifications
You must be signed in to change notification settings - Fork 0
A lightning-fast implementation of the Levenshtein distance algorithm. Written in AssemblyScript, compiled to WebAssembly, and optimized for speed.
License
hexrw/qlevens
Folders and files
| Name | Name | Last commit message | Last commit date | |
|---|---|---|---|---|
Repository files navigation
About
A lightning-fast implementation of the Levenshtein distance algorithm. Written in AssemblyScript, compiled to WebAssembly, and optimized for speed.
Resources
License
Stars
Watchers
Forks
Releases
No releases published
Packages 0
No packages published