Skip to search formSkip to main content
You are currently offline. Some features of the site may not work correctly.

Pattern matching

Known as: Matching, Pattern matching (functional programming), Pattern matches 
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… Expand
Wikipedia

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2008
Highly Cited
2008
Pattern matching over event streams is increasingly being employed in many areas including financial services, RFIDbased… Expand
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Highly Cited
2004
Highly Cited
2004
  • A. Trouvé
  • International Journal of Computer Vision
  • 2004
  • Corpus ID: 8322028
In a previous paper, it was proposed to see the deformations of a common pattern as the action of an infinite dimensional group… Expand
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Highly Cited
2002
Highly Cited
2002
XML employs a tree-structured data model, and, naturally, XML queries specify patterns of selection predicates on multiple… Expand
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Highly Cited
2002
Highly Cited
2002
XML queries typically specify patterns of selection predicates on multiple elements that have some specified tree structured… Expand
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Highly Cited
1994
Highly Cited
1994
This paper describes a generic model of matching that can be usefully applied to misuse intrusion detection. The model is based… Expand
  • figure 1
  • figure 2
Highly Cited
1987
Highly Cited
1987
We present randomized algorithms to solve the following string-matching problem and some of its generalizations: Given a string X… Expand
Highly Cited
1981
Highly Cited
1981
Abstract This paper studies several topics concerning the way strings can overlap. The key notion of the correlation of two… Expand
  • figure 1
  • figure 2
Highly Cited
1977
Highly Cited
1977
An algorithm is presented which finds all occurrences of one given string within another, in running time proportional to the sum… Expand
  • table 3
Highly Cited
1975
Highly Cited
1975
This paper describes a simple, efficient algorithm to locate all occurrences of any of a finite number of keywords in a string of… Expand
  • figure 1
Highly Cited
1973
Highly Cited
1973
In 1970, Knuth, Pratt, and Morris [1] showed how to do basic pattern matching in linear time. Related problems, such as those… Expand
  • figure 1
  • figure 2
  • figure 3