52 packages 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.

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... More information

A pattern matching library in C#

Library provides C# language extensions

Fuzzy string matcher based on FuzzyWuzzy algorithm from SeatGeek

Tokenizer extracts structured information from blocks of text and reflects them onto .NET objects

Implements template matching algorithm (~20x faster than conventional sliding window approach).

Provides a functional fluent syntax for C# based apps

Package for matching paths (files, directories) using the apache ant-style.

NMatcher is a simple library that eases tests (mostly with json).

A general purpose utility library implements Hidden Markov Models (HMM) for time-inhomogeneous Markov processes for .NET.

Portable library for easy to use F#-like Discriminated Unions in C#. Implicitly casts objects into OneOf instances, then use .Match extension to do pattern matching. Designed as a partial drop in replacement for OneOf.

A GPS map-matching solution for .NET platform. This solution is porting from the "barefoot" project which developed in Java.

A netstandard library that allows you to effortlessy grab files via glob/minimatch patterns. Great for resolving relative paths coming from the command-line

Library for fuzzy string matching. Can be used to find doublets or similarities between strings. -string metrics (Levenshtein, Jaccard, JaroWinkler,...) -algorithms (SortedNeigborhood, Blocking) -phonetic codecs(Soundex, DoubleMetaphone, Phonix, ...) -string tokenizer (NGram,... More information

An implementation of a discriminated union data structure with pattern matching support.

A Fast Local Descriptor for Dense Matching

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 flexible and easy to use .NET library that simplifies matching of values as well as filtering.

Heirarchycal Matching Lib, Some bug fixed!