Levenshtein Packages

Find the minimal edit path between two generic arrays.

An efficient JS implementation calculating the Levenshtein distance, i.e. the difference between two strings.

Set of functions for efficient implementation of approximate (fuzzy) search

A library for finding the most similar word from a list of words, supporting Japanese (including kanji). / 最も似た単語を単語群から検索する日本語(漢字含む)対応のライブラリ

A package to search dances with fuzzy matching

Uses cache to save already computed levenshtein distance. If the strings you compare often repeat, this will save you a lot of compotation power

Finds degree of similarity between strings, based on Dice's Coefficient.

FJS é uma biblioteca JavaScript que permite fazer buscas em um array de objetos com base em critérios de consulta flexíveis. Com o FJS, você pode realizar buscas complexas e precisas em seus dados usando operadores atômicos e operadores de busca avançados

Finds similar word(s) in a list of words

A TypeScript library for fuzzy string matching with normalization.

Calculates the Levenshtein (edit) distance between two strings.