Found 41 packages
Implements the Aho-Corasick string search algorithm
Methods for gets parts of the strings
A .net string search library that allows for mistakes ("fuzzy") that can work for substrings. Produces a 0-100 match number.
The Ngram analyzer is used to do substring searches efficently with RavenDB. To use the analyzer go to the folder where the Raven.Server.exe lives, create a folder named Analyzers (if doesn't exist already), and under it place the binary that is included in this package. Then you can reference it in your index just like any other analyzer. It works with the 1.0.960 RavenDb server. Also note the packaged analyzer uses a minimum gram of 2, and a maximum of 10. This is not configurable.
The Stringe is a wrapper for the .NET String object that tracks line, column, offset, and other metadata for substrings.
A .NET implementation for the Knuth-Moris-Pratt (KMP) algorithm
Thai string tokenizer is a dotnet Library tokenizer and Substring for Thai language
A series of string extension methods to make substrings easier. Contains methods such as SubstringOrShorter and Until, making simple code shorter and easier to write.
.NET Implementations of Trie Data Structures for Substring Search, Auto-completion and Intelli-sense. Includes: patricia trie, suffix trie and a trie implementation using Ukkonen's algorithm.
TEAM extensions to the .NET Framework
NList brings an enormous number of powerful, STL-like algorithms to the .NET platform for processing indexable collections. There is a handlebars.js-like text generator. It has a powerful IComparer builder. There is a DefaultDictionary class. There is a class to convert an object into a dictionary of its properties.
Unified algorithm support for indexed .NET collections.
Wrappers and extensions to the .NET collections and LINQ.
FuzzyString is a library developed for use in my day job for reconciling naming conventions between different models of the electric grid. I have stripped off the power system specific code and put together what can effectively be used as a string extension for determining approximate equality between two strings. All of the algorithms used here have been pulled from online resources, translated into C#, and compiled into this library. I found several other similar open-source implementations around but nothing for .NET/C#. Adding the *.dll to your project will give you access to this extension and the individual extensions under the hood of the ApproximatelyEquals() extension. Algorithms included in this project: Hamming Distance Jaccard Distance Jaro Distance Jaro-Winkler Distance Levenshtein Distance Longest Common Subsequence Longest Common Substring Overlap Coefficient Ratcliff-Obershelp Similarity Sorensen-Dice Distance Tanimoto Coefficient
Provides a set of general purpose Fluent Assertion extension methods methods extending from Xunit.
Removing / keeping parts of the string according to the position of the substring in it
Extensions for incomplete methods. string: Trim, Left, Right, Substring int: ToInt, ToIntNullable
Brahman is a set of snippets, algorithms and solution for end users based on Brahma.FSharp. Brahman.Substrings is a library for substrings matching."
Currently it supports below query mappings: primitive: field => c.field parent/child => c.parent.child Namespace.EnumType'enumVal' => 'enumVal' queries: $select => SELECT $filter => WHERE $top => TOP $orderby => ORDER BY functions: contains(field,'value') => CONTAINS(c.field,'value') startswith(field,'value') => STARTSWITH(c.field,'value') endswith(field,'value') => ENDSWITH(c.field,'value') toupper(field) => UPPER(c.field) tolower(field) => LOWER(c.field) length(field) => LENGTH(c.field) indexof(field,'value') => INDEX_OF(c.field,'value') substring(field,idx1,idx2) => SUBSTRING(c.field,idx1,idx2) trim(field) => LTRIM(RTRIM(c.englishName)) concat(field,'value') => CONCAT(c.englishName,'value')