PHP-TrieTree(中英文混合字典树)
-
Updated
Feb 12, 2018 - PHP
PHP-TrieTree(中英文混合字典树)
An Implementation of Ukkonens 1990 linear-time algorithm for finding an approximate shortest superstring in Java. Also includes an extendable version of Aho Corasick's efficient string matcher.
Using tries to create string matching using the Aho-Corasick algorithm.
Fast XS multiple substring matcher (like fgrep)
Implementation of the Aho-Corasick search algorithm for the C# course (NPRG038) at Charles University
Tasks for the interviews on DCAM departments, spring 2019
Given a set of words and a text. We have to print the number of occurrences of all words from the set
A library of .NET tools to help put real world use cases into interesting data structures/algorithms.
Implementation of the Aho-Corasick multiple pattern matching finite state automaton.
A Golang implementation of the Aho-Corasick string matching algorithm
Library for fast mulitple string matching (Aho-Corasick algorithm)
A convenient implementation of the Aho-Corasick algorithm to find multiple search patterns
This repository contains my projects created during Language and Libraries of Data Analysis on AGH
Useful datastructures not present in standard Python libraries
MultiFast is a fast multiple string search and replace tool which uses Aho-Corasick Algorithm. It contains a tidy and fast implementation of the Aho-Corasick algorithm as a C library and a search and replacement tool.
A C++ Implementation of the Aho-Corasick pattern matching algorithm.
Rust WASM tool to manipulate HTML searching for an input search term
Add a description, image, and links to the aho-corasick topic page so that developers can more easily learn about it.
To associate your repository with the aho-corasick topic, visit your repo's landing page and select "manage topics."