voluptatesea
The most efficient JS implementation calculating the Levenshtein distance, i.e. the difference between two strings.
The most efficient JS implementation calculating the Levenshtein distance, i.e. the difference between two strings.
VSCode alike fuzzy search
Fastest Levenshtein distance implementation in JS.
Mongoose fuzzy searching plugin
Search some text and receive a search score using configurable parameters
Give it a piece of text and a search query, and it splits it into chunks separating matches from non-matches, allowing you to highlight the matches, visually or otherwise, in your app.
A JavaScript library for fuzzy logic operations including fuzzy sets, fuzzy rules, and an inference engine.
This repository contains a fuzzy search library that provides a flexible way to search and match strings using various fuzzy matching algorithms. It supports multiple languages and allows for customization of search options such as algorithms, thresholds,
FuzzyJSONParser is a robust JSON parser designed to handle and recover data from JSON strings with extraneous text and incomplete structures. It can parse JSON strings that include redundant pre/post content and recover from missing closing characters lik
a cli tool to add fuzzy searching to a lb4 app
Jaccard string distance library
this package lets you compare two strings and give you how much percent they are similar
Finds degree of similarity between strings, based on Dice's Coefficient, which is mostly better than Levenshtein distance.
Fuzzy search with bias towards matching tokens
Turns fuzzy user time strings into a formatted time string
A tiny fuzzy search library
Searches a haystack for all best possible matches of needle, returning their position and Levenshtein distance.
string fuzzy equals
A React hook for fuzzy search
Intuitive approximate string matching (i.e. fuzzy searches)