A simple, fast, and flexible string similarity matcher for JavaScript and TypeScript. Supports both class and instance usage.
Match strings using bash. Does not work on windows, and does not read from the file system. This library requires that Bash 4.3 or higher is installed and is mostly used for checking parity in unit tests.
Search, hash, sort, fingerprint, and fuzzy-match strings faster via SWAR, SIMD, and GPGPU
Parse and serialize XBRL fact-match strings of the form prefix:name=value;... — values can be QNames, numbers, or quoted strings.
Match human-quality input to potential matches by edit distance.
Fuzzy-match strings.
Convert globs to regular expressions
A tiny, PEG-like system for building language grammars with regexes.
A tiny and extremely fast library for compiling and matching basic glob patterns
Express style path to RegExp utility
Fast Javascript text diff
Parses well-formed HTML (meaning all tags closed) into an AST and back. quickly.
Match strings to "detect subjects"
easier than regex string matching patterns for urls and other strings. turn strings into data or data into strings.
Provides metadata and conversions from repository urls for GitHub, Bitbucket and GitLab
Query result type converters for node-postgres
Allow parsing of the U+2028 LINE SEPARATOR and U+2029 PARAGRAPH SEPARATOR in JS strings
Escape U+2028 LINE SEPARATOR and U+2029 PARAGRAPH SEPARATOR in JS strings
JSON diff & patch (object and array diff, text diff, multiple output formats)
A light assertion library built with JSON APIs in mind.
ANSI escape codes for styling strings in the terminal
Expand a regular expression pattern into a set of words
Aho-Corasick machine for matching.It can be used to be implemented to match strings
It's a very fast and efficient glob library for Node.js
Lightweight pattern-matching utilities for strings and sequences, with a proc-macro for ergonomic syntax
Proc-macro to provide ergonomic pattern-matching syntax for the `match-string` crate
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.