128 Open source projects that are alternatives of or similar to Pyahocorasick

Data-Structures using C++.

Fast, efficient, in-memory Full Text Search for Kotlin

A collection of powerful data structures

42 library of basic C functions - queues, lists, memory operations and more 😄

Change cases quickly with vim motions in emacs

Like Javascript's string.replace, but accepts and returns an array

Contains solutions and codes to various online competitive programming challenges and some good problems. The links to the problem sets are specified at the beginning of each code.

敏感词查找,验证,过滤和替换 🤓 FindAll, Validate, Filter and Replace words.

Golang radix tree implementation

Fast specialized time-series database for IoT, real-time internet connected devices and AI analytics.

A collection of common algorithms and data structures implemented in Java.

📝 Provides a simple API to normalize texts, whitespaces, paragraphs & diacritics.

Create and modify trie prefix structures and extract word lists including prefixes, anagrams and sub-anagrams

Split a string on the first occurrence of a given separator

Unicode (UTF-8) capable std::string

A prefix tree (trie) implementation in go

Compact tries for fixed-width keys

Fast IP lookup table for IPv4/IPv6 prefixes

🉑 Portable UTF-8 library - performance optimized (unicode) string functions for php.

Sublime Text 2/3 plugin for string manipulations

A Collection of useful php helper functions.

Java Practiced Problems including concepts of OOPS, Interface, String , Collection.

String manipulation library for Clojure(Script)

just for fun

Way to check, match and resist.

Ergonomic trie data structure

Radix trees in Rcpp and R

A JavaScript library for Greek language with utilities such as replacement of accented and other diacritics characters, conversion from Greek to phonetic, transliterated or greeklish Latin and more.

Simple tool to extract the most common substrings from an input text. Built for password cracking.

Go datastructures.

Algorithmic Problems Solutions -- hash table code featured in geeksforgeeks

C++17 implementation of memory-efficient dynamic tries

Flexible modern C++ string library with type-safe formatting

leetcode.com , algoexpert.io solutions in python and swift

Data Structures & Algorithms. Includes solutions for Cracking the Coding Interview 6th Edition

Implementation of various Data Structures and algorithms - Linked List, Stacks, Queues, Binary Search Tree, AVL tree,Red Black Trees, Trie, Graph Algorithms, Sorting Algorithms, Greedy Algorithms, Dynamic Programming, Segment Trees etc.

An OOP approach to string manipulation.

코딩테스트 대비 문제집(Baekjoon Online Judge)

Fastest Trie structure (Linux & Windows)

A type driven approach to string interpolation, aiming at consistent, secure, and only-human-readable logs and console outputs !

Erasure coding (Reed–Solomon coding) in Go

String manipulation, leveled up!

bigint is a C++ library which can handle Very very Big Integers. It can calculate factorial of 1000000... it can go any big. It may be useful in Competitive Coding and Scientific Calculations which deals with very very large Integers. It can also be used in Decryption process. It has many inbuilt functions which can be very useful.

A Node implementation of the Aho-Corasick string matching algorithm based on DoubleArray Trie.

A minimal and powerful trie based url path router (or mux) for Go.

Project is in active development and has been moved to the EthereumJS VM monorepo.

A trie (prefix tree) data structure implementation in C#.

Efficient Trie-based regex unions for blacklist/whitelist filtering and one-pass mapping-based string replacing

Provides a string manipulation node with a chainable UI based on the concise and lightweight stringjs.com.

A simple way to safely do string replacement with React components

Just a package containing tools to manipulate a string.

Drop-in replacements for base R string functions powered by stringi

Python package for lexicon; Trie and DAWG implementation.

Muxie is a modern, fast and light HTTP multiplexer for Go. Fully compatible with the http.Handler interface. Written for everyone.

Trie (a.k.a. prefix tree) C# implementation. Has constant-time string prefix lookup.

Extra string functions for OCaml

C++ implementation of a fast and memory efficient HAT-trie

180+ Algorithm & Data Structure Problems using C++

The Capsule Hash Trie Collections Library

DAWG String Dictionary in C#