- StringDistances.jl VS diff-match-patch
- StringDistances.jl VS Cadmium
- StringDistances.jl VS Quickenshtein
- StringDistances.jl VS Java String Similarity
- StringDistances.jl VS mudderjs
- StringDistances.jl VS NLP-Model-for-Corpus-Similarity
- StringDistances.jl VS go-edlib
- StringDistances.jl VS fuzzy_pandas
StringDistances.jl Alternatives
Similar projects and alternatives to StringDistances.jl
-
diff-match-patch
Diff Match Patch is a high-performance library in multiple languages that manipulates plain text.
-
WorkOS
The modern identity platform for B2B SaaS. The APIs are flexible and easy-to-use, supporting authentication, user identity, and complex enterprise features like SSO and SCIM provisioning.
-
Quickenshtein
Making the quickest and most memory efficient implementation of Levenshtein Distance with SIMD and Threading support
-
Java String Similarity
Implementation of various string similarity and distance algorithms: Levenshtein, Jaro-winkler, n-Gram, Q-Gram, Jaccard index, Longest Common Subsequence edit distance, cosine similarity ...
-
mudderjs
Lexicographically-subdivide the “space” between strings, by defining an alternate non-base-ten number system using a pre-defined dictionary of symbol↔︎number mappings. Handy for ordering NoSQL keys.
-
NLP-Model-for-Corpus-Similarity
A NLP algorithm I developed to determine the similarity or relation between two documents/Wikipedia articles. Inspired by the cosine similarity algorithm and built from WordNet.
-
InfluxDB
Power Real-Time Data Analytics at Scale. Get real-time insights from all types of time series data with InfluxDB. Ingest, query, and analyze billions of data points in real-time with unbounded cardinality.
-
go-edlib
📚 String comparison and edit distance algorithms library, featuring : Levenshtein, LCS, Hamming, Damerau levenshtein (OSA and Adjacent transpositions algorithms), Jaro-Winkler, Cosine, etc...
StringDistances.jl reviews and mentions
-
How to do a fuzzy join of two datafrmaes in Julia ?
You'll need: * StringDistances.jl to calculate the distance between the strings. * FlexiJoins.jl to join the dataframes based on a predicate. * A custom function that you write that takes two strings as arguments and returns a boolean for if the strings are "close enough" based on their distance.
-
Getting the difference of two strings
If you need to know exactly what the diff is, you might want to use something like github.com/google/diff-match-patch. Otherwise, a simple Levenshtein distance would suffice. This library seems to have a whole bunch of string distances implemented. Hope this helps!
Stats
matthieugomez/StringDistances.jl is an open source project licensed under GNU General Public License v3.0 or later which is an OSI approved license.
The primary programming language of StringDistances.jl is Julia.
Popular Comparisons
Sponsored