strsim-rs - :abc: Rust implementations of string similarity metrics

  •        23

You can change the version in the url to see the documentation for an older version in the changelog. If you don't want to install Rust itself, you can run $ ./dev for a development CLI if you have Docker installed.

https://crates.io/crates/strsim
https://github.com/dguo/strsim-rs

Tags
Implementation
License
Platform

   




Related Projects

SymSpell - 1 million times faster through Symmetric Delete spelling correction algorithm

  •    CSharp

Spelling correction & Fuzzy search: 1 million times faster through Symmetric Delete spelling correction algorithm The Symmetric Delete spelling correction algorithm reduces the complexity of edit candidate generation and dictionary lookup for a given Damerau-Levenshtein distance. It is six orders of magnitude faster (than the standard approach with deletes + transposes + replaces + inserts) and language independent.

natural - general natural language facilities for node

  •    Javascript

"Natural" is a general natural language facility for nodejs. Tokenizing, stemming, classification, phonetics, tf-idf, WordNet, string similarity, and some inflections are currently supported.

textdistance - Compute distance between sequences

  •    Python

TextDistance -- python library for comparing distance between two or more sequences by many algorithms. Work in progress. Now all algorithms compare two strings as array of bits.


jellyfish - 🎐 a python library for doing approximate and phonetic matching of strings.

  •    Python

Jellyfish is a python library for doing approximate and phonetic matching of strings. Written by James Turk <james.p.turk@gmail.com> and Michael Stephens.

fast-levenshtein - Efficient Javascript implementation of Levenshtein algorithm with locale-specific collator support

  •    Javascript

An efficient Javascript implementation of the Levenshtein algorithm with locale-specific collator support. If you are not using any module loader system then the API will then be accessible via the window.Levenshtein object.

Levenshtein

  •    C++

A C++ class (One short include file) for calculating Levenshtein and Damerau distances. Template-based, no external dependency, compromise between concision and performance.

python-Levenshtein - The Levenshtein Python C extension module contains functions for fast computation of Levenshtein distance and string similarity

  •    C

I (Mikko Ohtamaa) am not currently maintaining this code. I just pulled in to Github for general good (was not available in public repo before). So if you file any issues I won't be looking into them.It supports both normal and Unicode strings.

Buffer - Swift μ-framework for efficient array diffs, collection observation and cell configuration.

  •    Swift

Swift μ-framework for efficient array diffs, collection observation and data source implementation. Buffer is designed to be very granular and has APIs with very different degrees of abstraction.

Levenshtein - Javascript implementation of the L-diggity.

  •    Javascript

Levenshtein string difference in Javascript. Levenshtein works in both the browser and node.js.

fuzzywuzzy - Fuzzy String Matching in Python

  •    Python

Fuzzy string matching like a boss. It uses Levenshtein Distance to calculate the differences between sequences in a simple-to-use package.

Ferret - An optimized substring search engine written in Go

  •    Go

Ferret makes use of a combination of an Inverted Index and a Suffix Array to allow log-time lookups with a relatively small memory footprint. Also incorporates error-correction (Levenshtein distance 1) and simple Unicode-to-ASCII conversion. Allows for arbitrary sorting functions Allows you to map arbitrary data to your results, and quickly update this data. The code is meant to be as fast as possible for a substring dictionary search, and as such is best suited for medium-large dictionaries with ~1-100 million total characters. I've timed 10s initialization for 3.5 million characters on a modern CPU, and 10us search time (4000us with error-correction), so this system is capable of ~100,000 queries per second on a single processor - feel free to try the benchmarks in dictionaryexample.go.

fuzzysearch - :pig: Tiny and fast fuzzy search in Go

  •    Go

Inspired by bevacqua/fuzzysearch, a fuzzy matching library written in JavaScript. But contains some extras like ranking using Levenshtein distance (see RankMatch()) and finding matches in a list of words (see Find()). Fuzzy searching allows for flexibly matching a string with partial input, useful for filtering data very quickly based on lightweight user input.

fuzzysearch - :pig: Tiny and fast fuzzy search in Go

  •    Go

Inspired by bevacqua/fuzzysearch, a fuzzy matching library written in JavaScript. But contains some extras like ranking using Levenshtein distance (see RankMatch()) and finding matches in a list of words (see Find()). Fuzzy searching allows for flexibly matching a string with partial input, useful for filtering data very quickly based on lightweight user input.

EtherAddressLookup - Adds links to strings that look like Ethereum addresses to your favourite blockchain explorer

  •    Javascript

The blacklists found in this repo serve both the EAL Chrome Extension & MetaMask Chrome Extension. We use a Levenshtein distance algoritm to detect similar URLs, so if you encounter an errounously-blocked website, please add it to the whitelist. The master branch is bundled on every release and pushed to the Chrome & Firefox Extension store, you can view/download it here: https://chrome.google.com/webstore/detail/etheraddresslookup/pdknmigbbbhmllnmgdfalmedcmcefdfn for Chrome, and https://addons.mozilla.org/en-US/firefox/addon/etheraddresslookup/ for Firefox.

proposal-bigint - Arbitrary precision integers in JavaScript

  •    HTML

Thanks for help and feedback on this effort from Brendan Eich, Waldemar Horwat, Jaro Sevcik, Benedikt Meurer, Michael Saboff, Adam Klein, Sarah Groff-Palermo and others. BigInt is a new primitive that provides a way to represent whole numbers larger than 253, which is the largest number Javascript can reliably represent with the Number primitive.

Blind Shark

  •    DotNet

Blind Shark is a musical game, where you have to find the music being played before your opponents.






We have large collection of open source products. Follow the tags from Tag Cloud >>


Open source products are scattered around the web. Please provide information about the open source projects you own / you use. Add Projects.