Finite-Pattern Set Exact String Matching Algorithm

A Finite-Pattern Set Exact String Matching Algorithm is an exact string matching algorithm that can solve a finite-pattern set exact string matching task.

• Context:
  • …
• Example(s):
  • Aho-Corasick String Matching Algorithm.
  • Rabin-Karp String Matching Algorithm.
  • [[]].
• Counter-Example(s):
  • Finite-Pattern Set Inexact String Matching Algorithm.
• See: Finite-Pattern Set Exact String Matching System.

---

---

References

2012

• http://en.wikipedia.org/wiki/String_searching_algorithm#Algorithms_using_finite_set_of_patterns
  • QUOTE:
    • Aho–Corasick string matching algorithm.
    • Commentz–Walter algorithm.
    • Rabin–Karp string search algorithm.

---