41 Open source projects that are alternatives of or similar to beda

Golang metrics for calculating string similarity and other string utility functions

Learned string similarity for entity names using optimal transport.

string similarity based on Dice's coefficient in go

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

Fuzzy string matching for PHP

Collection of sequence alignment algorithms.

A BK tree implementation for fast fuzzy string matching

String similarity functions, String distance's, Jaccard, Levenshtein, Hamming, Jaro-Winkler, Q-grams, N-grams, LCS - Longest Common Subsequence, Cosine similarity...

Lightweight string similarity function for javascript

Team reference for Competitive Programming. Algorithms implementations very used in the ACM-ICPC contests. Latex template to build your own team reference.

Simple string matching with questionmark- and star-wildcard operator

A CSharp (C#) diff library that allows you to diff two objects and get a list of the differences back.

Find common, removed and added element between two collections.

Effcee is a C++ library for stateful pattern matching of strings, inspired by LLVM's FileCheck

A collection of algorithms in rust

Library and command line utility to do approximate string matching of a source against a bitext index and get matched source and target.

A fuzzy matching string distance library for Scala and Java that includes Levenshtein distance, Jaro distance, Jaro-Winkler distance, Dice coefficient, N-Gram similarity, Cosine similarity, Jaccard similarity, Longest common subsequence, Hamming distance, and more..

Provides a string manipulation node with a chainable UI based on the concise and lightweight stringjs.com.

Minimal, super readable string pattern matching for python.

Python Modules of Variable Markov Oracle

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

Evaluate results from ASR/Speech-to-Text quickly

Way to check, match and resist.

No description or website provided.

iOS validation framework with form validation support

📐 A Cython implementation of the affine gap string distance

PFAC is an open library for exact string matching performed on NVIDIA GPUs

SIMDized check which bytes are in a set

Levenshtein algorithm in C

Similar string search in Levenshtein distance

Implementation of various string similarity and distance algorithms: Levenshtein, Jaro-winkler, n-Gram, Q-Gram, Jaccard index, Longest Common Subsequence edit distance, cosine similarity ...

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

💻 A fast and flexible O(n) difference algorithm framework for Swift collection.

Toolkit for k-mer with taxonomic information

一款高性能敏感词(非法词/脏字)检测过滤组件，附带繁体简体互换，支持全角半角互换，汉字转拼音，模糊搜索等功能。

Aho-Corasick string search algorithm PHP extension implementation.

Node.js string validator for more

A fast multiple string replace library for ruby. Uses a C implementation of the Aho–Corasick Algorithm based on https://github.com/morenice/ahocorasick while adding support for on the fly multiple string replacement. Faster alternative to String.gsub when dealing with non-regex (exact match) use cases

String matching algorithm benchmark

Finds degree of similarity between two strings, based on Dice's Coefficient, which is mostly better than Levenshtein distance.

Accelerating the deduplication and collapsing process for reads with Unique Molecular Identifiers (UMI). Heavily optimized for scalability and orders of magnitude faster than a previous tool.