Quickenshtein VS StringDistances.jl

Compare Quickenshtein vs StringDistances.jl and see what are their differences.

Our great sponsors
  • InfluxDB - Power Real-Time Data Analytics at Scale
  • WorkOS - The modern identity platform for B2B SaaS
  • SaaSHub - Software Alternatives and Reviews
Quickenshtein StringDistances.jl
- 2
273 135
- -
4.7 2.3
6 months ago 21 days ago
C# Julia
MIT License GNU General Public License v3.0 or later
The number of mentions indicates the total number of mentions that we've tracked plus the number of user suggested alternatives.
Stars - the number of stars that a project has on GitHub. Growth - month over month growth in stars.
Activity is a relative number indicating how actively a project is being developed. Recent commits have higher weight than older ones.
For example, an activity of 9.0 indicates that a project is amongst the top 10% of the most actively developed projects that we are tracking.

Quickenshtein

Posts with mentions or reviews of Quickenshtein. We have used some of these posts to build our list of alternatives and similar projects.

We haven't tracked posts mentioning Quickenshtein yet.
Tracking mentions began in Dec 2020.

StringDistances.jl

Posts with mentions or reviews of StringDistances.jl. We have used some of these posts to build our list of alternatives and similar projects. The last one was on 2023-01-30.
  • How to do a fuzzy join of two datafrmaes in Julia ?
    3 projects | /r/Julia | 30 Jan 2023
    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
    2 projects | /r/Julia | 9 Apr 2021
    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!

What are some alternatives?

When comparing Quickenshtein and StringDistances.jl you can also consider the following projects:

Pliant - [Moved to: https://github.com/patrickhuber/Pliant]

diff-match-patch - Diff Match Patch is a high-performance library in multiple languages that manipulates plain text.

js-levenshtein - The most efficient JS implementation calculating the Levenshtein distance, i.e. the difference between two strings.

Cadmium - Natural Language Processing (NLP) library for Crystal

JavaPermutationTools - A Java library for computation on permutations and sequences

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.

go-edlib - 📚 String comparison and edit distance algorithms library, featuring : Levenshtein, LCS, Hamming, Damerau levenshtein (OSA and Adjacent transpositions algorithms), Jaro-Winkler, Cosine, etc...

fuzzy_pandas - Fuzzy matches and merging of datasets in pandas using csvmatch