Fast Aho Corasick algorithm based on Double Array Trie.

Very fast C# implementation of Aho Corasick algorithm based on Double Array Trie: efficient text search of many substrings with O(n) complexity.

Automata state may be efficiently serialized to binary stream.

Info

Version:	1.1.1
Author(s):	Vitalii Fedorchenko
Last Update:	Tuesday, July 12, 2022
.NET Fiddle:	Create the first Fiddle
Project Url:	https://github.com/nreco/AhoCorasickDoubleArrayTrie
NuGet Url:	https://www.nuget.org/packages/NReco.Text.AhoCorasickDoubleArrayTrie

Install

NuGet .NET CLI Paket CLIR Direct Download

Install-Package NReco.Text.AhoCorasickDoubleArrayTrie

dotnet add package NReco.Text.AhoCorasickDoubleArrayTrie

paket add NReco.Text.AhoCorasickDoubleArrayTrie


                                NReco.Text.AhoCorasickDoubleArrayTrie Download (Unzip the "nupkg" after downloading)

Dependencies

.NETFramework 4.0

No dependencies.

.NETStandard 1.3

NETStandard.Library(>= 1.6.0)
System.Data.Common(>= 4.1.0)
System.Reflection(>= 4.1.0)
System.Reflection.Primitives(>= 4.0.1)

Fast Aho Corasick algorithm based on Double Array Trie. NuGet Package

Got any Fast Aho Corasick algorithm based on Double Array Trie. Question?

Info

Install

Dependencies

Tags

STATS

must-have-score

avg-downloads-per-day

days-since-last-release