Pattern matching Pattern matching Daitch-Mokotoff Soundex is a soundex algorithm invented in 1985 by Randy Daitch and Gary Mokotoff of the Jewish Genealogical Society. It is a refinement of the Russell soundex algorithm designed to allow matching of Slavic and Yiddish surnames with similar pronunciation and dissimilar spelling. ...more on Wikipedia about "Daitch-Mokotoff Soundex"
glob() is a Unix library function that expands file names using a pattern matching notation that resembles regular expression syntax but does not have the expressive power of true regular expressions. The word "glob" is also used as a noun when discussing a particular pattern, e.g. "use the glob *.log to match all those log files". ...more on Wikipedia about "Glob()"
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. ICU is widely portable to many operating systems and environments. It gives applications the same results on all platforms and between C/C++ and Java software. The ICU project is an open source development project that is sponsored, supported and used by IBM and many other companies. ...more on Wikipedia about "International Components for Unicode"
The algorithm, as described in Name Search Techniques, New ...more on Wikipedia about "New York State Identification and Intelligence System"
PCRE stands for Perl Compatible Regular Expressions. Derived from Perl's external interface, PCRE expressions are much richer than standard regular expressions which is why they have been adopted by many modern programming languages. Their syntax is much more powerful and flexible than POSIX regular expressions. ...more on Wikipedia about "PCRE"
A regular expression (abbreviated as regexp, regex, or regxp, with plural forms regexps, regexes, or regexen) is a string that describes or matches a set of strings, according to certain syntax rules. Regular expressions are used by many text editors and utilities to search and manipulate bodies of text based on certain patterns. Many programming languages support regular expressions for string manipulation. For example, Perl and Tcl have a powerful regular expression engine built directly into their syntax. The set of utilities (including the editor sed and the filter grep) provided by Unix distributions were the first to popularize the concept of regular expressions. ...more on Wikipedia about "Regular expression"
Soundex is a phonetic algorithm for indexing names by their sound when pronounced in English. The basic aim is for names with the same pronunciation to be encoded to the same string so that matching can occur despite minor differences in spelling. Soundex is the most widely known of all phonetic algorithms and is often used (incorrectly) as a synonym for "phonetic algorithm". ...more on Wikipedia about "Soundex"
wildmat is a pattern matching library developed by Rich Salz. Based on the wildcard syntax already used in the Bourne shell, wildmat provides a uniform mechanism for matching patterns across applications with simpler syntax than that typically offered by regular expressions. Patterns are implicitly anchored at the beginning and end of each string when testing for a match. ...more on Wikipedia about "Wildmat"
This article is licensed under the GNU Free Documentation License.
It uses material from the Wikipedia . Direct links to the original articles are in the text.
If you use exact copy or modified of this article you should preserve above paragraph and put also : It uses material from
the Shortopedia article about "Pattern matching".
| MAIN PAGE | MAIN INDEX | CONTACT US |