Checks strings against patterns and collects matched substrings
Unicode variant string matching
A library for approximate string matching.
balanced string matching, and replacing.
Fuzzy string matching algorithms and utilities, port of the TheFuzz Python library.
Ukkonens approximate string matching algorithm for finding edit distance similar to Levenshtein
easier than regex string matching patterns for urls and other strings. turn strings into data or data into strings.
Fast fuzzy string matching with scoring and matched ranges
Shorter string matching.
Implementation of the Aho-Corasick string searching algorithm, as described in the paper "Efficient string matching: an aid to bibliographic search".
A collection of string matching algorithms built with React Select in mind
Aho–Corasick string matching algorithm
TypeScript implementation of the Aho-Corasick algorithm for efficient string matching
Aho–Corasick string matching algorithm
Fast string matching and pattern validation utilities
Fast aproximate string matching library for use in autocomplete, perform both search and highlight.
Intuitive approximate string matching (i.e. fuzzy searches)
A nodejs library for phonetic string matching which exposes implementation of phonetic algorithms like soundex, metaphone and double-metaphone algorithms.
String matching utilities
Approximate (fuzzy) string matching just like you are used to from Sublime Text and others.
Powerful string matching insensitive to diacritics, special characters, symbols and case
Lightning-fast fuzzy string matching
Fast fuzzy string matching library for JavaScript/TypeScript with 10/10 performance score
gm-string-matching
Simple string matching with questionmark, star wildcard operator and an escaped character.
Simple string matching with single- and multi-character wildcard operator.
A library to evaluate YARA rules, used to scan bytes for textual and binary pattern
CLI utility to run boreal, a YARA rules engine
A memory efficient trie library.
A native Rust implementation of the SimString algorithm
Model Context Protocol server for recast — exposes safe, atomic, multi-file rewrites to MCP-aware AI agents (Claude Desktop, Cursor, Continue, ...). Same engine as recast-cli, no subprocess.
Hardware abstraction layer for the ifm CR1140/CR1141 (aarch64, Yocto Linux)
Safe, atomic, transparent multi-file text rewrites — regex / Rhai script / tree-sitter modes, two-phase commit with rollback, agent-friendly JSON output.
Engine behind the recast CLI: regex / Rhai script / tree-sitter rewrites, atomic two-phase commit, schema-locked JSON output.
Search, hash, sort, fingerprint, and fuzzy-match strings faster via SWAR, SIMD, and GPGPU
Tmux MCP server in Rust
Mustermann is your personal string matching expert. As an expert in the field of strings and patterns, Mustermann keeps its runtime dependencies to a minimum and is fully covered with specs and documentation. Given a string pattern, Mustermann will turn it into an object that behaves like a regular expression and has comparable performance characteristics.
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.
calculate Jaro Winkler distance.
Flex matching short abbreviations against longer strings is a boon in productivity for typists. Applications like Quicksilver, LaunchBar, and Launchy have made this method of keyboard entry a popular one.
calculate Jaro Winkler distance.
Implements Regexp#match?, String#match? and Symbol#match? in Ruby < 2.4.
Port of http://github.com/sunlightlabs/jellyfish
Parse semantic version strings into comparable objects with support for sorting, finding the latest version, and checking constraint satisfaction.
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
Parsey matches a string with a pattern to retrieve data from it.
Helps to match keywords with string of words
== FEATURES/PROBLEMS: * Partial string matching * The algorithm is not particularly performant == SYNOPSIS: require 'goto_string' s = %w(goto_string is a small library that implements a substring matching and ranking algorithm. The matching and ranking is similar to that found in Quicksilver or TextMate) GotoString::Matcher.match('string', s) #=> [["goto_string", "goto_string", 0.679259259259259, [["string", 5]]], ["substring", "substring", 0.461481481481481, [["s", 0], ["tring", 4]]]] An array is returned which contains one entry for each match. Matches are ordered by rank. Each match is itself an array, containing the following elements: [ "original candidate", "matched string", rank, [["substring_1", offset], ["substring_2", offset], ... ] ] You can optionally pass a block to the match method which will get each candidate passed to it. The return value of the block is what will be used for matching. This is so you can pass in arrays of complex objects as candidates: GotoString::Matcher.match( "goto", Project.find(:all) ) do |p| p.name end The resulting matches will contain a reference to the matched string (the project name) as well as the project (the original candidate) == REQUIREMENTS: * None
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.