pattern-matching character
Смотреть что такое "pattern-matching character" в других словарях:
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 contrast to pattern recognition, the match usually has to be exact. The patterns generally have the form … Wikipedia
Approximate string matching — In computing, approximate string matching is the technique of finding approximate matches to a pattern in a string. The closeness of a match is measured in terms of the number of primitive operations necessary to convert the string into an exact… … Wikipedia
Escape character — In computing and telecommunication, an escape character is a character which invokes an alternative interpretation on subsequent characters in a character sequence. An escape character is a particular case of metacharacters. Generally, the… … Wikipedia
Aho–Corasick string matching algorithm — The Aho–Corasick string matching algorithm is a string searching algorithm invented by Alfred V. Aho and Margaret J. Corasick. It is a kind of dictionary matching algorithm that locates elements of a finite set of strings (the dictionary ) within … Wikipedia
Elastic Matching — is one of the pattern recognition technique in computer science. Elastic matching (EM) is also known as deformable template, flexible matching, or nonlinear template matching.Elastic matching can be defined as an optimization problem of two… … Wikipedia
Regular expression — In computing, a regular expression provides a concise and flexible means for matching (specifying and recognizing) strings of text, such as particular characters, words, or patterns of characters. Abbreviations for regular expression include… … Wikipedia
Perl Compatible Regular Expressions — Original author(s) Philip Hazel Stable release 8.20 / 2011 10 21; 25 days ago (2011 10 21) Written in C … Wikipedia
TUTOR (programming language) — Infobox programming language name = TUTOR (aka PLATO Author Language) paradigm = imperative (procedural) year = c. 1965 designer = Paul Tenczar Richard Blomme [from page 4 of The TUTOR Language by Bruce Sherwood, 1974.] developer = Paul Tenczar… … Wikipedia
JBIG2 — is an image compression standard for bi level images, developed by the Joint Bi level Image Experts Group. It is suitable for both lossless and lossy compression. According to a press release [ [http://www.jpeg.org/public/mauijbig.pdf Press… … Wikipedia
String searching algorithm — String searching algorithms, sometimes called string matching algorithms, are an important class of string algorithms that try to find a place where one or several strings (also called patterns) are found within a larger string or text. Let Σ be… … Wikipedia
AWK — This article is about the programming language. For other uses, see AWK (disambiguation). AWK Paradigm(s) scripting, procedural, event driven Appeared in 1977 Designed by Alfred Aho, Peter Weinberger, and Brian Kernighan … Wikipedia
