Loading Icon

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).

Metrics Summary

Total Publications
Lifetime
5,103
Prior Five Years
891
Total Citations
Lifetime
66,745
Prior Five Years
3,092
Total Scholars
Lifetime
6,821
Prior Five Years
5,026

Institutional Rankings

Global (Worldwide)
Show More
National Institutional Rankings

Publications and Citation History

Publications based on Disciplines

Scholars based on Disciplines

Publications based on Fields

Scholars based on Fields

Highly Ranked Scholars™

Lifetime
Prior Five Years

Highly Cited Publications

Lifetime