levenshtein
A high-performance Go library for calculating Levenshtein distance between strings, including Unicode support.
What is levenshtein?
levenshtein is a Go implementation of the Levenshtein distance algorithm that calculates the minimum number of edits needed to transform one string into another. It solves the problem of measuring string similarity for applications like spell checking, fuzzy searching, and natural language processing. The library is optimized for performance and supports Unicode characters across different languages.
Go developers who need efficient string comparison functionality for text processing, search engines, data deduplication, or natural language applications. It's particularly useful for those working with international text and requiring high-performance similarity calculations.
Developers choose this library because it offers superior performance compared to alternatives, with benchmarks showing 55-60% faster execution and zero allocations for many cases. Its clean API and Unicode support make it a reliable choice for production applications needing accurate string distance calculations.
Overview
Go implementation to calculate Levenshtein Distance.
Use Cases
Best For
- Implementing fuzzy search algorithms in Go applications
- Building spell checkers or autocorrect systems
- Data deduplication by identifying similar text entries
- Natural language processing tasks requiring string similarity
- Creating recommendation systems based on text similarity
- Benchmarking string distance algorithms in Go
Not Ideal For
- Applications processing strings longer than 65,536 characters (runes)
- Projects requiring automatic Unicode normalization without manual pre-processing
- Use cases needing alternative string similarity metrics like Jaro-Winkler or Damerau–Levenshtein
- Developers seeking a comprehensive string utility library with multiple algorithms
Pros & Cons
Pros
Benchmarks show it's 55-60% faster than alternatives like dgryski/trifles and arbovm/levenshtein, with significant speed improvements across ASCII, French, Nordic, and Tibetan strings.
Operates with zero allocations for many cases, reducing garbage collection pressure, as evidenced by benchmark results showing 0 B/op for common string types.
Handles non-ASCII strings including French, Nordic, and Tibetan characters seamlessly, though normalization is left to the user for flexibility.
Provides a single ComputeDistance function with clear documentation and examples, making integration straightforward for basic use cases.
Cons
As a performance optimization, it caps strings at 65,536 runes; longer strings require pinning to version 1.0.3, which may involve breaking changes or reduced functionality.
The library doesn't normalize strings, forcing users to manually handle Unicode normalization with external packages, adding complexity for international text.
Focuses solely on Levenshtein distance, lacking support for other string similarity algorithms that might be needed in broader text analysis applications.
Frequently Asked Questions
Related Projects
bleveA modern text/numeric/geo-spatial/vector indexing library for go
trieData structure and relevant algorithms for extremely fast prefix/fuzzy string searching.
go-edlib📚 String comparison and edit distance algorithms library, featuring : Levenshtein, LCS, Hamming, Damerau levenshtein (OSA and Adjacent transpositions algorithms), Jaro-Winkler, Cosine, etc...
go-adaptive-radix-treeAdaptive Radix Trees implemented in Go
Found a gem we're missing?
Open-Awesome is built by the community, for the community. Submit a project, suggest an awesome list, or help improve the catalog on GitHub.