0 views collected around this technical thread.
This article explains the Knuth-Morris-Pratt (KMP) string‑matching algorithm, describes how the next array is built to capture prefix‑suffix information, shows Java implementations of the search and next‑array construction, and discusses common optimizations to reduce redundant comparisons.
This article introduces the FuzzyWuzzy Python library, explains its underlying Levenshtein distance algorithm, demonstrates how to install it, describes the key functions in the fuzz and process modules, and provides practical examples for matching company names and province fields with complete code snippets.
This article introduces PHP's preg_match function, demonstrates simple and complex regular expression examples—including string and email matching—and explains common regex patterns, showing how to perform powerful and flexible text matching in backend development.
This article introduces the FuzzyWuzzy Python library, explains its Levenshtein‑based matching functions (Ratio, Partial Ratio, Token Sort Ratio, Token Set Ratio) and the process module, and demonstrates practical applications for fuzzy matching of company and province names with complete code examples.
This article introduces the Python FuzzyWuzzy library, explains its Levenshtein‑based fuzzy string matching functions such as Ratio, Partial Ratio, Token Sort Ratio and Token Set Ratio, demonstrates how to use the process module for extracting best matches, and provides practical code examples for matching company and province names.
This article introduces the FuzzyWuzzy Python library, explains its Levenshtein‑based matching functions such as Ratio, Partial Ratio, Token Sort Ratio and Token Set Ratio, demonstrates how to install it, and provides practical code examples for merging company and province fields with fuzzy matching thresholds.
This tutorial explains how to use the Python FuzzyWuzzy library, which relies on Levenshtein distance, to perform fuzzy string matching for tasks such as normalizing province or company names, and provides complete code examples and practical applications.
This article introduces common graph concepts and several advanced string‑matching algorithms—including Brute‑Force, Rabin‑Karp, KMP, Boyer‑Moore, AC automaton, Trie, and Double‑Array Trie—explaining their principles, implementations, complexity analyses, and typical application scenarios for search systems.
This article introduces the FuzzyWuzzy Python library, explains its Levenshtein‑based matching functions, shows how to install it, and provides step‑by‑step code examples for fuzzy matching of company and province names using pandas dataframes.
This article explains the Boyer‑Moore string‑matching algorithm, detailing how the bad‑character and good‑suffix heuristics dramatically reduce comparisons, and provides a complete Java implementation with step‑by‑step illustrations of each matching round and the underlying shift calculations.
This article explains the brute‑force (BF) substring search algorithm, demonstrates its step‑by‑step operation with examples, then introduces a simple hash‑based sliding‑window method (a basic Rabin‑Karp approach), provides Java code, and shows how to compute and update hashes efficiently to locate a pattern in a main string.
This article explains the Brute‑Force (BF), Boyer‑Moore (BM), and Knuth‑Morris‑Pratt (KMP) string‑matching algorithms, illustrates their operation with step‑by‑step visual examples, discusses the inefficiencies of BF, the shift rules of BM, and the prefix‑suffix logic of KMP, and provides a complete Java implementation including the construction of the next array.
This article introduces the fundamentals of regular expressions, explains their components, syntax rules such as quantifiers and anchors, and provides a collection of frequently used regex patterns for tasks like email validation, ID numbers, dates, IP addresses, and URLs.
This article introduces Python's re module, explaining regular expression fundamentals, key functions such as match, search, compile, sub, findall, finditer, and split, detailing their syntax, parameters, flags, and providing numerous code examples to illustrate pattern matching, searching, replacing, and splitting strings.
This article explains the KMP string‑matching algorithm, how it builds the prefix (next) table to avoid the O(M·N) worst‑case of naive search, provides JavaScript implementations, compares it with Boyer‑Moore and V8's indexOf strategy, and includes detailed code examples.
This article explains how to use a trie (prefix tree) to efficiently filter sensitive words in a text, covering the basic concepts, construction steps, traversal algorithm, complexity analysis, and a Java implementation using HashMap.
This article introduces several classic string‑matching algorithms—including Brute‑Force, KMP, Boyer‑Moore, BMH, Sunday, Shift‑And/Or, and bitmap techniques—explaining their principles, preprocessing steps, and practical considerations for improving text search performance.