Linear-time string search and comparison algorithms.
TypeScript definitions for string-algorithms
Algorithms to help you parse CSS from an array of tokens.
JSON Web Token implementation (symmetric and asymmetric)
Implementation of JSON Web Signatures
Solve CSS math expressions
Xml digital signature and encryption library for Node.js
JWA implementation (supports all JWS algorithms)
Native JS murmur hash implementation
Browser Compatible Object Hashing
various machine learning routines for node
A fully persistent balanced binary search tree
Boyer-Moore-Horspool algorithms
Fast JSON Web Token implementation
Lightning fast hash functions for browsers and Node.js using hand-tuned WebAssembly binaries (MD4, MD5, SHA-1, SHA-2, SHA-3, Keccak, BLAKE2, BLAKE3, PBKDF2, Argon2, bcrypt, scrypt, Adler-32, CRC32, CRC32C, RIPEMD-160, HMAC, xxHash, SM3, Whirlpool)
A JavaScript implementation of the JSON Object Signing and Encryption (JOSE) for current web browsers and node.js-based servers
A Node.js module for the optimized JavaScript implementation of the MurmurHash algorithms.
Package implements data structures and algorithms for processing various types of graphs
Implementation of EIP-7754
Parse CSS media query lists.
Parse CSS Cascade Layer names.
Types and schema that specs of the Markup languages for markuplint
A robust base64 encoder/decoder that is fully compatible with `atob()` and `btoa()`, written in JavaScript.
A conversational AI-driven telecom multi-agent system for managing call balances, push notifications, marketing, targeting, and sales.
jaro_winkler is an implementation of Jaro-Winkler \ distance algorithm which is written in C extension and will fallback to pure \ Ruby version in platforms other than MRI/KRI like JRuby or Rubinius. Both of \ C and Ruby implementation support any kind of string encoding, such as \ UTF-8, EUC-JP, Big5, etc.
This gem implements pure Levenshtein algorithm, Damerau modification (where 2 character transposition counts as 1 edit distance). It also includes Boehmer & Rees 2008 modification, to handle transposition in blocks with more than 2 characters (Boehmer & Rees 2008).
An algorithm that allows searching for members of a known set of strings appearing as substrings of a larger string in time linear to both the size of the string and the size of the set
Ruby implementation of LZ-String compression algorithm
A simple library with String Metric algorithms
This gem can be used for finding strings by their phonetic sound - optimized for the german language
A Ruby port of lz-string - a string compression algorithm with support for multiple encodings (base64, URI, UTF16)
Computes java hashCode algorithm for given string
Match strings approximately using multiple algorithms: Levenshtein edit distance, Damerau-Levenshtein with transpositions, Jaro-Winkler similarity, Dice coefficient, Hamming distance, and Longest Common Subsequence. Includes token-based matching, weighted scoring, Soundex and Metaphone phonetic matching, ranked search, and deduplication.
Got a big string? Let me search it. Shift yo bits down, flip it and reverse it.
Amatch is a library for approximate string matching and searching in strings. Several algorithms can be used to do this, and it's also possible to compute a similarity metric number between 0.0 and 1.0 for two given strings.
A Ruby implementation of the Aho-Corasick string matching algorithm
No description provided.
No description provided.
No description provided.
No description provided.
No description provided.
No description provided.
No description provided.
No description provided.
No description provided.
No description provided.
No description provided.
No description provided.