Search

fast-myers-diff

A fast, minimal, memory-efficient diff algorithm on strings, arrays, and typed arrays.

v3.2.0 URL: https://unpkg.com/fast-myers-diff@3.2.0/bin/index.js

OpenBrowse Files

myersdifflcs

node-lcs

Implementations for the Longest Common Substring algorithm [O(nm) time]

v1.0.4 URL: https://unpkg.com/node-lcs@1.0.4/index.js

OpenBrowse Files

lcslongestcommonsubstring

@algorithm.ts/lcs

Find the longest common subsequence.

v4.0.5 URL: https://unpkg.com/@algorithm.ts/lcs@4.0.5/lib/cjs/index.cjs

OpenBrowse Files

algorithmlcslongest common subsequence

mdiff

An LCS Implementaion for Arrays and Strings

v1.4.2 URL: https://unpkg.com/mdiff@1.4.2/lib/index.js

OpenBrowse Files

difflcslongest common subsequenceedit-distancearraystring

cmpstr

CmpStr is a lightweight, fast and well performing package for calculating string similarity

v3.0.1 URL: https://unpkg.com/cmpstr@3.0.1

OpenBrowse Files

string-similaritystring-comparisonfuzzy-matchingphonetic-searchphonetic-algorithmssimilarity-metricsbatch-processingtext-searchpairwise-comparisonnormalizationfilteringtext-analysisdiffdiffingtypescriptasynchronouscustom-algorithmsmetricsalgorithmslevenshteindamerau-levenshteinjaro-winklercosinedice-coefficienthamming-distancejaccard-indexneedleman-wunschlcssmith-watermanq-gramsoundexmetaphonecologne-phoneticprofilingextensible