Approximate string matching In computer science, approximate string matching (often colloquially referred to as fuzzy string searching) is the technique of finding strings that match a pattern approximately (rather ...
Backtracking Backtracking is a general algorithm for finding all (or some) solutions to some computational problem, that incrementally builds candidates to the solutions, and abandons each partial candidate...
Caverphone The Caverphone phonetic matching algorithm was created by David Hood in the Caversham Project at the University of Otago in New Zealand in 2002.
Compressed pattern matching In computer science compressed pattern matching or CPM is the process of searching for patterns in compressed data with little or no decompression.
Daitch–Mokotoff Soundex Daitch–Mokotoff Soundex (D–M Soundex) is a phonetic algorithm invented in 1985 by Jewish genealogists Gary Mokotoff and Randy Daitch.
Delimiter A delimiter is a sequence of one or more characters used to specify the boundary between separate, independent regions in plain text or other data streams.
diff In computing, diff is a file comparison utility that outputs the differences between two files.
Escape character In computing and telecommunication, an escape character is a character which invokes an alternative interpretation on subsequent characters in a character sequence.
find (command) In computing, find is a command in the command line interpreters of DOS, OS/2 and Microsoft Windows.
Findstr (computing) In computing, findstr is a command in the command line interpreters (shells) of Microsoft Windows.
glob (programming) In computer programming, in particular in a Unix-like environment, the term globbing is sometimes used to refer to pattern matching based on wildcard characters.
International Components for Unicode International Components for Unicode (ICU) is an open source project of mature C/C++ and Java libraries for Unicode support, software internationalization, and software globalization.
Match Rating Approach Match Rating Approach performs well with names containing the letter "y" unlike the original flavour of the NYSIIS algorithm.
Match rating approach Match rating approach performs well with names containing the letter "y" unlike the original flavour of the NYSIIS algorithm.
Metacharacter A metacharacter is a character that has a special meaning (instead of a literal meaning) to a computer program, such as a shell interpreter or a regular expression engine.
Metaphone Metaphone is a phonetic algorithm, an algorithm published in 1990 for indexing words by their English pronunciation.
Oniguruma Oniguruma by K. Kosako is a BSD licensed regular expression library that supports a variety of character encodings.
Pandemonium architecture Pandemonium architecture arose in response to the inability of template matching theories to offer a biologically plausible explanation of the image constancy phenomena.
Parser Grammar Engine The Parser Grammar Engine is a compiler and runtime for a Perl 6 rules for the Parrot virtual machine.
Pattern matching In computer science, pattern matching is the act of checking a perceived sequence of tokens for the presence of the constituents of some pattern.
Perl Compatible Regular Expressions Perl Compatible Regular Expressions (PCRE) is a regular expression C library inspired by the regular expression capabilities in the Perl programming language, written by Philip Hazel, star...
Point set registration In computer vision and pattern recognition, point set registration, also known as point matching, is the process of finding a spatial transformation that aligns two point sets.
Ragel Ragel is a finite-state machine compiler with output support for C, C++, C#, Objective-C, D, Java, OCaml, Go, and Ruby source code.
ReDoS The regular expression denial of service (ReDoS) is a denial-of-service attack that exploits the fact that most regular expression implementations may reach extreme situations that cause t...
RegexBuddy RegexBuddy is a regular expression tool by Just Great Software Co. Ltd. for the Microsoft Windows operating system.
Regular expression In theoretical computer science and formal language theory, a regular expression (abbreviated regex or regexp) is a sequence of characters that forms a search pattern, mainly for use...
Rete algorithm The Rete algorithm (or rarely or) is an efficient pattern matching algorithm for implementing production rule systems.
ReteOO ReteOO is an improved version of the Rete algorithm.
RNA22 Rna22 is a pattern-based algorithm for the discovery of microRNA target sites and the corresponding heteroduplexes.
Soundex Soundex is a phonetic algorithm for indexing names by sound, as pronounced in English.
Teiresias algorithm The Teiresias algorithm is a combinatorial algorithm for the discovery of rigid patterns (motifs) in biological sequences.
Terminal and nonterminal symbols In computer science, terminal and nonterminal symbols are the lexical elements used in specifying the production rules that constitute a formal grammar.
Tom (pattern matching language) Tom is a programming language particularly well-suited for programming various transformations on tree structures and XML based documents.
Wildcard character The term wildcard character has the following meanings: In telecommunications, a wildcard is a character that may be substituted for any of a defined subset of all possible characters.
wildmat wildmat is a pattern matching library developed by Rich Salz.