Search results
130 packages found
Regular expression for matching ANSI escape codes
Fastest Levenshtein distance implementation in JS.
- levenshtein
- distance
- fast
- fastest
- edit
- string
- similarity
- algorithm
- match
- comparison
- fuzzy
- search
- matching
- similar
- View more
easier than regex string matching patterns for urls and other strings. turn strings into data or data into strings.
- url
- string
- matching
- pattern
- routing
- route
- regex
- match
- segment
- parsing
- parser
- parse
- combinator
- combinators
- View more
Measure the difference between two strings using the Levenshtein distance algorithm
- leven
- levenshtein
- distance
- algorithm
- string
- difference
- diff
- fast
- fuzzy
- similar
- similarity
- compare
- comparison
- edit
- View more
Simple wildcard matching
Compare two values with various paramaters.
Powerful string matching insensitive to diacritics, special characters, symbols and case
Ukkonens approximate string matching algorithm for finding edit distance similar to Levenshtein
a library for matching human-quality input to a list of potential matches using the Levenshtein distance algorithm
- closest
- compare
- comparison
- didyoumean
- diff
- difference
- distance
- edit
- find
- fuzzy
- leven
- levenshtein
- match
- matching
- View more
Pattern matching library
- array
- condition
- match
- matching
- object
- pattern
- pattern-matching
- predicate
- string
- regex
- regular expression
- nested
- deep
- recursive
Checks strings against patterns and collects matched substrings
Trie, Prefix tree. Javascript & Typescript Data Structure.
- Trie
- prefix tree
- prefixtree
- Prefix tree
- prefix-tree
- prefix
- digital tree
- digitaltree
- Digital Tree
- digital-tree
- digital
- radix tree
- radixtree
- Radix Tree
- View more
Qap, a quick parser/matcher optimized for string and buffer patterns (<= 255 bytes).
Convert matching double-quotes to single-quotes: `I "love" unicorns` → `I 'love' unicorns`
The most efficient JS implementation calculating the Levenshtein distance, i.e. the difference between two strings.
- levenshtein
- distance
- algorithm
- algo
- string
- difference
- diff
- fast
- fuzzy
- similar
- similarity
- compare
- comparison
- edit
- View more
Intuitive approximate string matching (i.e. fuzzy searches)
Fastest Levenshtein distance implementation in JS.
- levenshtein
- distance
- fast
- fastest
- edit
- string
- similarity
- algorithm
- match
- comparison
- fuzzy
- search
- matching
- similar
- View more
Prompt engineering text similarity matchers for Jest
Regular expression matching for URL's. Maintained, safe, and browser-friendly version of url-regex. Resolves CVE-2020-7661. Works in Node v10.12.0+ and browsers.