Developed by devhub.io
Swift μ-framework for efficient array diffs, collection observation and cell configuration.
Algolia Search API Client for Android
Various utilities regarding Levenshtein transducers. (Java)
Removes most frequent words (stop words) from a text content. Based on a Curated list of language statistics.
Enable git-like did-you-mean feature in click :sparkles:
A pure Lua implementation of bk-trees, created because it was needed for fuzzy term matching.
This is the Go implementation to calculate Levenshtein Distance.
Search YouTube with Levenshtein distances
A .NET port of java-string-similarity
An Elixir package for calculating between-list edit distances.
:ok_hand: Simple search suggestion using the Levenshtein distance algorithm.