SettingsPattern matching
Approximate string matching
In computer science, approximate string matching is the technique of finding strings that match a pattern approximately.
In computer science, approximate string matching is the technique of finding strings that match a pattern approximately.
Backtracking
Backtracking is a general algorithm for finding all solutions to some computational problem, that incrementally builds candidates to the solutions, and abandons each partial candidate c as ...
Backtracking is a general algorithm for finding all solutions to some computational problem, that incrementally builds candidates to the solutions, and abandons each partial candidate c as ...
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.
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 pattern in compressed data with little or no decompression.
In computer science Compressed Pattern Matching or CPM is the process of searching for pattern 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.
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.
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.
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.
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 (shells) of DOS, OS/2 and Microsoft Windows.
In computing, find is a command in the command line interpreters (shells) of DOS, OS/2 and Microsoft Windows.
Findstr (computing)
In computing, findstr is a command in the command line interpreters (shells) of Microsoft Windows.
In computing, findstr is a command in the command line interpreters (shells) of Microsoft Windows.
glob (programming)
In computer programming, the verb glob or globbing is used to refer to an instance of pattern matching behavior.
In computer programming, the verb glob or globbing is used to refer to an instance of pattern matching behavior.
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.
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 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.
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.
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.
Metaphone is a phonetic algorithm, an algorithm published in 1990 for indexing words by their English pronunciation.
New York State Identification and Intelligence System
The New York State Identification and Intelligence System Phonetic Code, commonly known as NYSIIS, is a phonetic algorithm devised in 1970 as part of the New York State Identification and Intell...
The New York State Identification and Intelligence System Phonetic Code, commonly known as NYSIIS, is a phonetic algorithm devised in 1970 as part of the New York State Identification and Intell...
Oniguruma
Oniguruma by K. Kosako is a BSD licensed regular expression library that supports a variety of character encodings.
Oniguruma by K. Kosako is a BSD licensed regular expression library that supports a variety of character encodings.
Pandemonium architecture
Pandemonium architecture arose as an answer to the inability of the template matching theories to offer a biologically plausible explanation of the image constancy phenomena.
Pandemonium architecture arose as an answer to the inability of the 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.
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 some sequence of tokens for the presence of the constituents of some pattern.
In computer science, pattern matching is the act of checking some sequence of tokens for the presence of the constituents of some pattern.
Perl Compatible Regular Expressions
Perl Compatible Regular Expressions is a regular expression C library inspired by Perl's external interface, written by Philip Hazel.
Perl Compatible Regular Expressions is a regular expression C library inspired by Perl's external interface, written by Philip Hazel.
Ragel
Ragel is a finite-state machine compiler with output support for C, C++, Objective-C, D, Java, Go and Ruby source code.
Ragel is a finite-state machine compiler with output support for C, C++, Objective-C, D, Java, 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 them t...
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 them t...
RegexBuddy
RegexBuddy is a regular expression tool by Just Great Software Co. Ltd. for the Microsoft Windows operating system.
RegexBuddy is a regular expression tool by Just Great Software Co. Ltd. for the Microsoft Windows operating system.
Regular expression
In computing, a regular expression provides a concise and flexible means to "match" strings of text, such as particular characters, words, or patterns of characters.
In computing, a regular expression provides a concise and flexible means to "match" strings of text, such as particular characters, words, or patterns of characters.
Rete algorithm
The Rete algorithm is an efficient pattern matching algorithm for implementing production rule systems.
The Rete algorithm is an efficient pattern matching algorithm for implementing production rule systems.
ReteOO
ReteOO is an improved version of the Rete algorithm.
ReteOO is an improved version of the Rete algorithm.
Soundex
Soundex is a phonetic algorithm for indexing names by sound, as pronounced in English.
Soundex is a phonetic algorithm for indexing names by sound, as pronounced in English.
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.
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.
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.
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.
wildmat is a pattern matching library developed by Rich Salz.