Uses Levenshtein Distance to find the closest string match or matches in an array

Generate a random string match a given regular expression, suitable for mocking strings.

Match substrings on the left or right of a given index, ignoring whitespace

A library for approximate string matching.

Customisable string match sorting features

`String.prototype.matchAll` ponyfill.

A regex to match any full character, considering weird character ranges.

Match balanced character pairs, like "{" and "}"

Wrapper around a VSM-dictionary, that manages a cache of string-match results

Matches strings against configurable strings, globs, regular expressions, and/or functions

Find multiple RegExp matches in a string

simple persistent cookiejar system

Regular expression for matching ANSI escape codes

Match a Unicode property or property alias to its canonical property name per the algorithm used for RegExp Unicode property escapes in ECMAScript.

Convert globs to regular expressions

Get the first path that exists on disk of multiple paths

Dependency-free request URI matcher

Match balanced character pairs, like "{" and "}"

A tiny, PEG-like system for building language grammars with regexes.

Match human-quality input to potential matches by edit distance.