Top 20 NuGet match Packages

A fast globbing library for .NET applications, including .net core. Doesn't use Regex.
String wildcard match (I can not believe no one already wrote a simple NuGet package to do this).
F# style discriminated unions or C#, using a custom type OneOf<T0, ... Tn> which holds a single value and has a .Match(...) method on it for exhaustive matching. Simple but powerful.
F# style discriminated unions or C#, using a custom type OneOf<T0, ... Tn> which holds a single value and has a .Match(...) method on it for exhaustive matching. Simple but powerful.
Split name into military rank, honorific, first name, middle initial, last name, suffix, gender. Also matches names.
This package extends the OneOf types from OneOf<T0, .., T9> to OneOf<T0, .., T32> for when you really have a lot of options
Low-allocation version of DiffMatchPatch
Diff.Match.Patch is a port of google-diff-match-patch.
Diff Match Patch (diff-match-patch) binding library for Bridge.NET projects.
This is an FSharp library for interop with the C# OneOf Types
Analyzer for indexing phonetic signatures (for sounds-alike search) for the Lucene.Net full-text search engine library from The Apache Software Foundation.
F# style discriminated unions or C#, using a custom type OneOf<T0, ... Tn> which holds a single value and has a .Match(...) method on it for exhaustive matching. Simple but powerful.
Implements the Aho-Corasick string search algorithm
TextMatch is a library for searching inside texts using Lucene query expressions. Supports all types of Lucene query expressions - boolean, wildcard, fuzzy. Options are available for tweaking tokenization, such as case-sensitivity and word stemming.
Match Media Mock (match-media-mock) binding library for Bridge.NET projects.
Machine Learning model for classifying gaming screenshots to determine a gaming match outcome.
Library is used to perform fuzzy matching (matching simillar strings). It uses Levenshtein Distance algorithms to perform this operation. In information theory, linguistics and computer science, the Levenshtein distance is a string metric for measuring the difference between two sequences. Informa...
The Diff Match and Patch libraries offer robust algorithms to perform the operations required for synchronizing plain text. Diff: Compare two blocks of plain text and efficiently return a list of differences. Diff Demo Match: Given a search string, find its best fuz...
TextDiscovery AngleSharp implementations of IDomInterpreter, IDomNodeFactory, and IHtmlConverter. Enables the following capabilities: mark search hits in the DOM, create HTML excerpts at a given word count with configurable element-breaking rules, and more.
Linear-progressive text discovery engine exposing functionality through simple service APIs. Break plain text into a sequence of slices which can be reconstituted as annotated text. Generate meta-rich tokens from a search expression to then be used to annotate source text matches; noise-word detect...