awesome/awesome-go
1
0
Fork 0
mirror of https://github.com/avelino/awesome-go.git synced 2024-12-12 17:13:58 +00:00
Code Issues Packages Projects Releases Wiki Activity

Add agext/levenshtein to 'Data Structures'

Browse Source
This commit is contained in:
Alex 2017-02-17 02:16:17 -05:00
parent 6aba4f3dd1
commit a06746a18f
1 changed files with 2 additions and 1 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

1
README.md
View File

@ -228,6 +228,7 @@ Please take a quick gander at the [contribution guidelines](https://github.com/a
* [goskiplist](https://github.com/ryszard/goskiplist) - A skip list implementation in Go.
* [gota](https://github.com/kniren/gota) - An implementation of dataframes, series, and data wrangling methods for Go.
* [hilbert](https://github.com/google/hilbert) - Go package for mapping values to and from space-filling curves, such as Hilbert and Peano curves.
* [levenshtein](https://github.com/agext/levenshtein) - Levenshtein distance and similarity metrics with customizable edit costs and Winkler-like bonus for common prefix.
* [levenshtein](https://github.com/agnivade/levenshtein) - Implementation to calculate levenshtein distance in Go.
* [mafsa](https://github.com/smartystreets/mafsa) - MA-FSA implementation with Minimal Perfect Hashing
* [roaring](https://github.com/RoaringBitmap/roaring) - Go package implementing compressed bitsets.