report · Data Archiving and Networked Services (DANS) · 2009

Pattern matching

Hak, Tony, Dul, Jan

Cited by 0Open access

Abstract

textabstractPattern matching is comparing two patterns in order to determine whether they match (i.e., that they are the same) or do not match (i.e., that they differ). Pattern matching is the core procedure of theory-testing with cases. Testing consists of matching an “observed pattern” (a pattern of measured values) with an “expected pattern” (a hypothesis), and deciding whether these patterns match (resulting in a confirmation of the hypothesis) or do not match (resulting in a disconfirmation). Essential to pattern matching (as opposed to pattern recognition, which is a procedure by which theory is built) is that the expected pattern is precisely specified before the matching takes place.

Cite this paper

APA 7

Hak, T., & Dul, J. (2009). Pattern matching. Data Archiving and Networked Services (DANS).

MLA 9

Hak, Tony, and Jan Dul. “Pattern matching.” Data Archiving and Networked Services (DANS), 2009.

Chicago

Hak, Tony, and Jan Dul. 2009. “Pattern matching.” Data Archiving and Networked Services (DANS).

Harvard

Hak, T. and Dul, J. (2009) ‘Pattern matching’, Data Archiving and Networked Services (DANS).

BibTeX

@article{hak2009pattern,
  title = {{Pattern matching}},
  author = {Hak, Tony and Dul, Jan},
  journal = {Data Archiving and Networked Services (DANS)},
  year = {2009}
}

Made from the index record. Check names, capitalisation and page numbers against the paper. Need another style? AI for Research has over 10,000.