returned for Tags:"Matching"
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.
This library uses and abuses the features of C# 6 and 7 to provide a functional 'Base class library', that, if you squint, can look like extensions to the language itself.
1,113 total downloads
Simple type safe pattern matching for C#
A pattern matching library in C#
Tokenizer extracts structured information from blocks of text and reflects them onto .NET objects
390 total downloads
Rule based matching
NMatcher is a simple library that eases tests (mostly with json).
Implements template matching algorithm (~20x faster than conventional sliding window approach).
A Fast Local Descriptor for Dense Matching
First Release of TagMatchLib
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.
Heirarchycal Matching Lib, Some bug fixed!
Fuzzy string matcher based on FuzzyWuzzy algorithm from SeatGeek
A general purpose utility library implements Hidden Markov Models (HMM) for time-inhomogeneous Markov processes for .NET.
Infrastructure package used by scapp
A proof-of-concept implementation of a pattern matching engine for C#.
A netstandard library that allows you to effortlessy grab files via glob/minimatch patterns. Great for resolving relative paths coming from the command-line
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...
Library (.Net Standard 1.0) to support text and person name matching.
Currently contains Levenshtein and Damerau-Levenshtein (optimal string alignment version) edit distance and normalized similarity functions optimized for speed and reduced memory consumption. There are also versions of the...
A library which enables more powerful pattern matching than is currently available in the switch statement.