string-distance

Open-source projects categorized as string-distance | Edit details

Top 9 string-distance Open-Source Projects

  • GitHub repo 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 ...

  • GitHub repo go-edlib

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

  • Scout APM

    Scout APM: A developer's best friend. Try free for 14-days. Scout APM uses tracing logic that ties bottlenecks to source code so you know the exact line of code causing performance issues and can get back to building a great product faster.

  • GitHub repo Cadmium

    Natural Language Processing (NLP) library for Crystal

  • GitHub repo StringDistances.jl

    String Distances in Julia

    Project mention: Getting the difference of two strings | reddit.com/r/Julia | 2021-04-09

    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!

  • GitHub repo Quickenshtein

    Making the quickest and most memory efficient implementation of Levenshtein Distance with SIMD and Threading support

  • GitHub repo 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.

    Project mention: The surprisingly difficult problem of user-defined order in SQL | news.ycombinator.com | 2021-01-15

    I have solved this problem for my own purposes — no claims of grand scalability or high efficiency — by storing indices or "ranks" of items as strings (Postgres TEXT) using a library called mudderjs[0] and a thin wrapper around it[1]. Sorted lexicographically (in dictionary order) arbitrary-length strings have arbitrary precision. You can always find a string between any two strings; for instance, between "a" and "b" is "am" and between "a" and "ab" is "aam". You do have to have the entire ordered collection in scope to generate a new rank for an item, but reordering an item only requires updating one row and isn't subject to floating point precision.

    [0] https://github.com/fasiha/mudderjs

    [1] https://github.com/pubpub/pubpub/blob/master/utils/rank.ts

  • GitHub repo strutil-go

    Golang metrics for calculating string similarity and other string utility functions (by adrg)

  • Nanos

    Run Linux Software Faster and Safer than Linux with Unikernels.

  • GitHub repo TySug

    A project around helping to prevent typing typos. TySug (Typo Suggestions) suggests alternative words with respect to keyboard layouts

  • GitHub repo JavaPermutationTools

    A Java library for computation on permutations and sequences

NOTE: The open source projects on this list are ordered by number of github stars. The number of mentions indicates repo mentiontions in the last 12 Months or since we started tracking (Dec 2020). The latest post mention was on 2021-04-09.

string-distance related posts

Index

What are some of the best open-source string-distance projects? This list will help you:

Project Stars
1 Java String Similarity 2,402
2 go-edlib 290
3 Cadmium 181
4 StringDistances.jl 97
5 Quickenshtein 82
6 mudderjs 65
7 strutil-go 44
8 TySug 10
9 JavaPermutationTools 3
Find remote jobs at our new job board 99remotejobs.com. There are 33 new remote jobs listed recently.
Are you hiring? Post a new remote job listing for free.
SaaSHub - Software Alternatives and Reviews
SaaSHub helps you find the best software and product alternatives
www.saashub.com