Tagged articles

9 articles

Page 1 of 1

Apr 7, 2026 · Information Security

Why Brute‑Force Won’t Cut It for Sensitive‑Word Filtering (And What Actually Works)

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-CorasickDFADouble-Array Trie

0 likes · 26 min read

Why Brute‑Force Won’t Cut It for Sensitive‑Word Filtering (And What Actually Works)

Java Companion

Dec 18, 2025 · Backend Development

Building a High‑Performance Sensitive‑Word Filter with SpringBoot and DFA

This article explains why traditional string‑search and regex methods struggle with large keyword sets, introduces the deterministic finite automaton (DFA) approach using a Trie structure for linear‑time matching, provides full Java implementations, and discusses real‑world applications and advanced optimizations such as double‑array Tries, Aho‑Corasick, and sharding with Bloom filters.

DFASensitiveWordFilterSpringBoot

0 likes · 17 min read

Building a High‑Performance Sensitive‑Word Filter with SpringBoot and DFA

Code Ape Tech Column

Nov 20, 2025 · Backend Development

Build a Millisecond‑Scale Sensitive Word Filter with DFA and Trie in Java

This article explains why traditional string matching and regex struggle with large keyword sets, introduces a DFA‑based solution using a Trie tree for linear‑time detection, provides full Java implementations, shows real‑world integration scenarios, and explores advanced optimizations such as double‑array tries, Aho‑Corasick automata, and sharding with Bloom filters.

DFASensitive Word FilteringTrie

0 likes · 17 min read

Build a Millisecond‑Scale Sensitive Word Filter with DFA and Trie in Java

Rare Earth Juejin Tech Community

Mar 2, 2024 · Fundamentals

Understanding Regular Expressions: Syntax, Engines, and Best Practices

This article provides a comprehensive overview of regular expressions, covering their basic syntax, meta‑characters, quantifiers, greedy vs. non‑greedy matching, look‑ahead/behind, capture groups, engine types such as NFA and DFA, performance pitfalls, optimization tips, major flavors (POSIX, PCRE, RE2), and practical examples for password validation and code‑block extraction.

DFANFAcapture groups

0 likes · 37 min read

Understanding Regular Expressions: Syntax, Engines, and Best Practices

Laravel Tech Community

Jun 19, 2023 · Backend Development

Using the php-dfa-sensitive Library for Sensitive Word Detection in PHP Projects

This article explains how to install the php-dfa-sensitive Composer package, create a SensitiveWords service in a Laravel‑style PHP application, and use its static methods to detect, replace, mark, or retrieve illegal words from user‑generated content.

BackendDFAText Filtering

0 likes · 3 min read

Using the php-dfa-sensitive Library for Sensitive Word Detection in PHP Projects

NetEase Cloud Music Tech Team

Feb 23, 2023 · Fundamentals

Regular Expressions and Finite Automata: Theory, Performance, and Conversion

The article shows how greedy versus lazy regex patterns can differ dramatically in speed, explains that regular expressions are compiled into finite automata, walks through converting regexes to NFAs, transforming them into DFAs, minimizing those DFAs, and illustrates how backtracking and catastrophic backtracking arise, urging developers to grasp automata theory for writing efficient, reliable patterns.

BacktrackingDFANFA

0 likes · 22 min read

Regular Expressions and Finite Automata: Theory, Performance, and Conversion

php Courses

Jan 27, 2021 · Backend Development

Integrating php-dfa-sensitive for Sensitive Word Detection in PHP Applications

This guide explains how to install the php-dfa-sensitive library via Composer, create a SensitiveWords service class with helper methods, configure custom word dictionaries, and use the provided static functions to detect, replace, or mark sensitive words in PHP projects.

BackendComposerDFA

0 likes · 3 min read

Integrating php-dfa-sensitive for Sensitive Word Detection in PHP Applications

DataFunTalk

Sep 15, 2020 · Information Security

Optimizing Regular Expression Engines for High‑Performance Deep Packet Inspection

This article presents a series of algorithmic innovations—including efficient NFA construction, reduced epsilon‑transitions, prefix/suffix optimizations, fast NFA‑to‑DFA conversion, space‑compressed automata, hybrid finite automata, and large‑scale regex matching techniques—designed to improve regular‑expression matching speed and memory usage in deep packet inspection systems.

Algorithm OptimizationDFANFA

0 likes · 27 min read

Optimizing Regular Expression Engines for High‑Performance Deep Packet Inspection

Alibaba Cloud Developer

Aug 25, 2017 · Fundamentals

Avoid Catastrophic Backtracking: How Regex Can Crash Your Server

A detailed exploration of how a complex regular expression used for shop‑name validation caused CPU spikes due to catastrophic backtracking, explaining DFA vs NFA engines, greedy, lazy and possessive quantifiers, and offering practical tips to write performant regexes.

DFANFAcatastrophic backtracking

0 likes · 9 min read

Avoid Catastrophic Backtracking: How Regex Can Crash Your Server