A pure haskell implementation of Aho-Corasick algorithm (student project)

AhoCorasick, AC自动机

This is a command-line program for searching text for multiple words (or phrases) in a single pass. The runtime is O(n + m + z), where n is the length of the searched text, m is the total length of all the words we are looking for, and z is the total number of occurrences of words we are looking for.

PHP-TrieTree(中英文混合字典树)

Implementation of various string matching algorithms and their experimental analysis. Contains paper describing different string matching algorithms with their time and space complexities.

The implementation of perfect hashing based parallel failureless Aho-Corasick algorithm on Graphic Processing Units

This repository contains code for Design and analysis of Algorithm(IT252) course mini Project "Plagiarism-Detector in Python"

Implementation of Aho-Corasick Trie.

PFAC is an open library for exact string matching performed on NVIDIA GPUs

A C++ implementation of the Aho Corasick algorithm

Cython bindings on C++ aho_corasick libarary

Concurrent implementation of Aho-Corasick string matching algorithm in C.

discrete analysis

Generalized edit distance command line tool

Aho-Corasick Algorithm visualization

Efficient String Matching Regular Expressions

A Golang implementation of the Aho-Corasick string-searching algorithm

A Golang implementation of the Aho-Corasick string matching algorithm

Deals with the Algorithms along with the explanation.

Ben Sherman is a UK broker who is looking for industrial investment opportunities in the cities of Asia. He already invested in a company in Kuala Lumpur and now he plans to travel to several cities in Asia from Kuala Lumpur to expand his investment. One of the essences of computer science and information technology is to solve problem faced by…