JSPM

Fast, bash-like range expansion. Expand a range of numbers or letters, uppercase or lowercase. See the benchmarks. Used by micromatch.

Port of diff-match-patch to TypeScript.

-

.

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

Read the closest package.json file

a Painless error library, naming error and matching them easily

Match two different strings and calculate a score from them. Use multipliers to finetune the score and bring your own threshold to see if the two strings match enough

-

-

-

Ready to use JavaScript regex you need!

Option in TypeScript

Compute and compare perceptual hashes for text strings to check similarity.

高级对象搜索工具库，支持多层级嵌套对象、数组自动展开、自定义匹配逻辑和安全深度控制

Tools for working with Zod schemas.

A fork of js-levenshtein by gustf adding a limit to the distance calculation.

-

data structure used in matching service

[![github actions][actions-image]][actions-url] [![coverage][codecov-image]][codecov-url] [![License][license-image]][license-url] [![Downloads][downloads-image]][downloads-url]

-

 [](https://www.npmjs.com/package/@ffras4vnpm/voluptas-ullam-dolorum) [![js-sta

I originally wrote this to compare title headlines from local news websites I web scrape. On any given day, all the websites can have the same story with the title being very similar, which helps me check for duplicate articles.