Was (wer) ist pattern-matching - definition

ACT OF CHECKING A GIVEN SEQUENCE OF TOKENS FOR THE PRESENCE OF THE CONSTITUENTS OF SOME PATTERN

Pattern-matching; Pattern match; Pattern matches; Pattern Matching; Pattern matching (functional programming); Structural pattern matching

Pattern matching

In computer science, pattern matching is the act of checking a given sequence of tokens for the presence of the constituents of some pattern. In contrast to pattern recognition, the match usually has to be exact: "either it will or will not be a match.

https://en.wikipedia.org/wiki/Pattern_matching

pattern matching

1. A function is defined to take arguments of a particular type, form or value. When applying the function to its actual arguments it is necessary to match the type, form or value of the actual arguments against the formal arguments in some definition. For example, the function length [] = 0 length (x:xs) = 1 + length xs uses pattern matching in its argument to distinguish a null list from a non-null one. There are well known algorithm for translating pattern matching into conditional expressions such as "if" or "case". E.g. the above function could be transformed to length l = case l of [] -> 0 x:xs -> 1 : length xs Pattern matching is usually performed in textual order though there are languages which match more specific patterns before less specific ones. 2. Descriptive of a type of language or utility such as awk or Perl which is suited to searching for strings or patterns in input data, usually using some kind of {regular expression}. (1994-11-28)

Gestalt Pattern Matching

STRING-MATCHING ALGORITHMS FOR DETERMINING THE SIMILARITY OF TWO STRINGS

Ratcliff/Obershelp Pattern Recognition; Ratcliff/Obershelp; R/O; Gestalt Pattern Matching

Gestalt Pattern Matching, also Ratcliff/Obershelp Pattern Recognition, is a string-matching algorithm for determining the similarity of two strings. It was developed in 1983 by John W.

https://en.wikipedia.org/wiki/Gestalt_Pattern_Matching

Wikipedia

Pattern matching

In computer science, pattern matching is the act of checking a given sequence of tokens for the presence of the constituents of some pattern. In contrast to pattern recognition, the match usually has to be exact: "either it will or will not be a match." The patterns generally have the form of either sequences or tree structures. Uses of pattern matching include outputting the locations (if any) of a pattern within a token sequence, to output some component of the matched pattern, and to substitute the matching pattern with some other token sequence (i.e., search and replace).

Sequence patterns (e.g., a text string) are often described using regular expressions and matched using techniques such as backtracking.

Tree patterns are used in some programming languages as a general tool to process data based on its structure, e.g. C#, F#, Haskell, ML, Python, Ruby, Rust, Scala, Swift and the symbolic mathematics language Mathematica have special syntax for expressing tree patterns and a language construct for conditional execution and value retrieval based on it.

Often it is possible to give alternative patterns that are tried one by one, which yields a powerful conditional programming construct. Pattern matching sometimes includes support for guards.

https://en.wikipedia.org/wiki/Pattern matching

Aussprachebeispiele für pattern-matching

1. association and pattern matching.

Replace Humans or Work with Them _ Alonso Vera _ Talks at Google

2. SARAH E. BURGAMY: Pattern matching--

Burgamy _ Talks at Google

3. that the pattern-matching work that

The Second Machine Age _ Erik Brynjolfsson & Andrew McAfee _ Talks at Google

4. So you're talking about-- like-- pattern matching--

Burgamy _ Talks at Google

5. without any fancy computer pattern-matching

ted-talks_445_JoeDeRisi_2006-320k

Beispiele aus Textkorpus für pattern-matching

1. He sympathizes, he said, with an analyst facing an unknown threat who gathers enormous volumes of data "and says, ‘There must be a secret in there.‘ " But pattern matching, he argued, will not find it.