Tagged articles
Aho-Corasick
13 articles · Page 1 of 1
This article details the design and implementation of a high‑performance text content moderation system, covering the end‑to‑end workflow, the core Aho‑Corasick multi‑pattern matching algorithm, its double‑array Trie optimization, memory and speed benchmarks, and practical deployment considerations for large‑scale news client platforms.
Aho-CorasickBackendalgorithm optimization
0 likes · 18 min read

The article walks through the evolution of sensitive‑word filtering—from naïve brute‑force scanning to Trie, Aho‑Corasick automaton, Double‑Array Trie, and DFA implementations—detailing their algorithms, time/space complexities, concrete Java code examples, performance trade‑offs, high‑concurrency optimizations, and practical production advice for building a robust content‑moderation system.
Aho-CorasickDFAJava
0 likes · 26 min read

Faced with minutes‑long posting delays and exploding review costs in a fast‑growing social app, the team introduced 24‑hour shift staffing, a local blacklist stored in MySQL, an in‑memory Trie + Aho‑Corasick matcher, Redis‑driven hot updates and a machine‑audit fallback with a feedback loop, dramatically cutting latency, cost and false‑positives.
Aho-CorasickContent moderationGo
0 likes · 33 min read

This article details how to design and implement a scalable, low‑cost content moderation pipeline that combines a local Trie + Aho‑Corasick engine, Redis‑based hot‑updates, MySQL persistence, and third‑party machine‑review fallback to achieve millisecond‑level response, high accuracy, and controllable costs.
Aho-CorasickBackendContent moderation
0 likes · 34 min read

This article analyzes high‑throughput sensitive‑word filtering by comparing brute‑force, KMP, Trie, double‑array Trie and Aho‑Corasick algorithms, presents their time and space complexities, shows Java implementations for Trie and AC automata, evaluates Netty deployment options, and offers practical optimizations such as asynchronous detection, hot‑reloading, tiered responses, logging and fuzzy matching.
Aho-CorasickJavaKMP
0 likes · 37 min read

This article explains the Aho‑Corasick automaton, a classic multi‑pattern matching algorithm that builds a Trie with fail pointers to achieve linear‑time search over massive keyword sets, and demonstrates a Java implementation for highlighting keywords in HTML documents.
Aho-CorasickAlgorithmCode Example
0 likes · 10 min read

This article explains the Aho‑Corasick automaton, detailing its construction, fail‑pointer mechanism, linear‑time complexity, and practical Java implementation for highlighting keywords in HTML, demonstrating its power for massive real‑time text search.
Aho-CorasickAlgorithmJava
0 likes · 10 min read

The article analyzes various Java string‑replacement techniques—including simple String.replace, compiled regular expressions, Aho‑Corasick automaton, and custom Trie implementations—by presenting their designs, object sizes, and benchmark results to guide developers in choosing the most efficient solution for large keyword sets.
Aho-CorasickJavaTrie
0 likes · 13 min read

This article examines various Java string‑replacement techniques—including simple replace, regex, Aho‑Corasick, and custom Trie implementations—by presenting their design, code samples, and detailed performance benchmarks to help developers choose the most efficient solution for large keyword sets.
Aho-CorasickAlgorithmJava performance
0 likes · 13 min read

By replacing the naïve double‑loop matcher with a Double‑Array Trie‑based Aho‑Corasick automaton and refactoring the system into a layered name‑and‑data microservice architecture that shards the keyword dictionary and rebuilds the automaton only on version changes, the real‑time keyword‑matching service reduced latency from seconds to milliseconds even at thousands of QPS.
Aho-CorasickJavaTrie
0 likes · 17 min read

The article describes how Vivo's content moderation platform, DiTing, uses algorithm selection—including Aho‑Corasick automaton, combination word matching, and pinyin‑based matching—to efficiently detect sensitive terms in large‑scale text streams, while addressing challenges such as homophones, multi‑character patterns, and performance constraints.
Aho-CorasickContent moderationPinyin Matching
0 likes · 14 min read

This article describes a Java‑based solution that dynamically adds brand and model hyperlinks to automotive articles by building multilingual keyword dictionaries with HanLP and employing an Aho‑Corasick Double‑Array Trie for efficient, context‑aware matching without altering the original content.
Aho-CorasickHanLPJava
0 likes · 12 min read

FlashText is an open‑source Python library that dramatically speeds up keyword search and replacement in large text corpora, turning multi‑day regex operations into a fifteen‑minute task by leveraging the Aho‑Corasick algorithm and a Trie‑based dictionary.
Aho-CorasickFlashTextPython
0 likes · 8 min read
