👮‍♂️The sensitive word tool for java.(敏感词/违禁词/违法词/脏词。基于 DFA 算法实现的高性能 java 敏感词过滤工具框架。内置支持单词标签分类分级。请勿发布涉及政治、广告、营销、翻墙、违反国家法律法规等内容。高性能敏感词检测过滤组件，附带繁体简体互换，支持全角半角互换，汉字转拼音，模糊搜索等功能。)

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

PruningRadixTrie - 1000x faster Radix trie for prefix search & auto-complete

🇨🇳Open Chinese Convert is an opensource project for conversion between Traditional Chinese and Simplified Chinese.(java 中文繁简体转换，支持台湾、香港、中文日文转换。)

My implementation of 85+ popular data structures and algorithms and interview questions in Python 3 and C++

A lightweight full text indexer for .NET

The jieba-analysis tool for java.（基于结巴分词词库实现的更加灵活优雅易用，高性能的 java 分词实现。支持词性标注。）

Sensitive Words Detection 一个高性能的敏感词检测和过滤库，基于 Go 语言开发，采用整洁架构设计。专注于中文文本的敏感词检测，支持多种检测策略和灵活的扩展机制。

基于Netty4开发的简单、轻量级、高性能的的Http restful api server

A golang http router based on trie tree.

使用python实现了一个简单的trie树结构，可增加/查找/删除关键词，用于中文文本的关键词匹配、停用词删除等。

pinyintokenizer, 拼音分词器，将连续的拼音切分为单字拼音列表。

快写完了....支持泛型的数据结构库(vec, linkedlist, skiplist, hashtable, btree, avltree, rbtree, trie, set

Tookit-Sihui, a tool of some common algorithm, AI文本混合科学计算器(calculator-sihui), 句子词频-逆文本频率(TF-IDF),搜索BM25, 前缀树搜索关键词(trietree), 模板匹配-递归函数(func_recursive)，中文数字转阿拉伯数字(chinese to number)，阿拉伯数字转汉语数字， HMM, CRF

Sensitive-rs is a Rust library for finding, validating, filtering, and replacing sensitive words. It provides efficient algorithms to handle sensitive words, suitable for various application scenarios.

Coordinate Hash Trie: A Trie Variant Balancing between Time, Space, and Simplicity

No description provided.

Python version Aho-Corasic Automaton.

a simple text editor in java for DS project

Data Structures in C++

Missing Trie implementation for Go

A simple sensitive word detector based on trie, implemented in python. 一个简易的python敏感词检测器，基于trie树(DFA算法)。

:zap: Lightning fast Search Bar component for React using Trie! Get filtered results and suggested searches on the go!

A trie-tree string-matching in golang, fatster than trie 2 regex.

php word filtering based on double array trie tree. :zap:

Advance data structure includes DSU, BIT, SQRT Decomposition, Segment Tree, Lazy Propagation, Trie Tree etc.

Designed this project as a Teacher Assistant for the Data Structures course.

A quick and efficient data structure for indexing MQTT subscriptions in a highly concurrent environment.

"Data Structures & Algorithms" course project, Fall 2022.

extensible, high-performance configuration management library, optimized for hierarchical data