returned for Tags:"Matching"
Library provides C# language extensions
The fastest Levenshtein on NuGet. Supports .NET Framework and .NET Core (.NET Standard 1.0).
Levenshtein calculates the shortest possible distance between two strings. Producing a count of the number of insertions, deletions and substitutions to make one string into another.
Succinc<T> is a .NET library that adds a number of functional features to C#:
* Discriminated unions,
* Pattern matching,
* Partial applications,
* "Implicitly" typed lambdas,
* The ability to treat void methods as Unit functions,
* Replacements for TryParse methods that return an Option<T> (or...
Implements template matching algorithm (~20x faster than conventional sliding window approach).
Provides a functional fluent syntax for C# based apps
Ant Path Matching
Package for matching paths (files, directories) using the apache ant-style.
Tokenizer extracts structed information from blocks of text and reflects them onto .NET objects
A Fast Local Descriptor for Dense Matching
Binaries for the PatternMatcher library.
Visit https://github.com/tejacques/PatternMatcher for an overview and usage examples.
Brahman is a set of snippets, algorithms and solution for end users based on Brahma.FSharp.
Brahman.Substrings is a library for substrings matching."
A simple dll that contains a matching class to match strings and to calculate the score of similarity between the two strings using the Ratcliff-Obershelp algorithm.
A managed wrapper to the CMT algorithm for visual object tracking.
A pattern matching library in C#
199 total downloads
Simple type safe pattern matching for C#
Just Another Pattern Matching
Poor man's and Just Another Pattern Matching simple helper class
A library for F# like functional patten matching based on the work of Bob Nystrom.
An implementation of a discriminated union data structure with pattern matching support.
a .net implementation of an Aho Corasich pattern matching state machine
A Simple Supply Demand Solver
SupplyDemandSolver provides a simple Supply Demand matching algorithm. It supports supplier capacity, demand priorities for different suppliers as well as constraint categories to limit matching.