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

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

🇨🇳Open Chinese Convert is an opensource project for conversion between Traditional Chinese and Simplified Chinese.(java 中文繁简体转换)

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

跨平台/多语言的 相似向量/相似词/相似句 高性能检索引擎。功能强大，使用方便。欢迎star & fork，周末可提供支持服务

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

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

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

A golang http router based on trie tree.

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

Python version Aho-Corasic Automaton.

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

a simple text editor in java for DS project

Competetive Programming : Online Judge Problems Solution

生成词典，快速匹配关键词

The tree data structure is a versatile object ; This offering offers the Trie tree - And Binary tree - Data tree. Information can be save at nodes of the tree Trees can be Printed to Tree-view Control / Function Insert / Find Prefix / Find Word a Start Character is used and Stop Character is used. the Trie tree Can store Characters as nodes; Used for Faster String matching! The binary is numerical addressing ; given a numerical value / find the node in the tree to store the value; Sentences can be added to the Search Tree; As well as finding prefixes and suffixes of sentences in the trie

Generate Go code to match using trie (prefix tree)

A mini search engine implemented in C++ using trie, maxheap, hashmap and various linked lists.

Projeto de LP II e EDB II com Árvore Trie de Prefixos

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

This Gradle based project written in Java demonstrate implementation of autocomplete suggestions feature (library) similar to as given by Google

C++ homework code and final project

Python and PHP Trie Tree class to filter sensetive word

Data Structures and Algorithms in Python

A fast phrases completion library using trie tree. Also provide path compression for lower memory usage

文字过滤，支持敏感词匹配，由DFA算法实现

Provide solutions of different wordgames

coding problems from course 6 of the Bioinformatics specialization

C# implementation of a ternary search trie.

data structures (avl, tries, binary search) experimental project for CEID