LIB · Go

fast-levenshtein

In simple terms

Measures how similar two texts are by counting the edits needed to turn one into the other. Works well with accents, CJK characters and emoji — not just plain letters.

Technical details

Modern fork of ka-weihe/fast-levenshtein in Go 1.26. Uses stack-local tables for ASCII and local maps for Unicode, achieving a heap-free fast-path for ≤64 runes. Implements blocked Myers O((n/64)·m) with DP fallback for weighted costs, measured in runes (not bytes).

Go 1.26Myers bit-parallel

Highlights

ASCII fast-path 0 allocs (2 KiB stack) + Unicode U+10FFFF via runes
Dual API: Distance and DistanceWithCost with insert/delete weights
Thread-safe — verified with -race and fuzzing; ~13k ns/op for len 4

Install

go get github.com/yukiteruamano/fast-levenshtein/v2

Lines of code

689

100%

Last recorded activity 3 commits · 52 sem

Last recorded activity in the project.