Finite-Pattern Set Exact String Matching Task
(Redirected from finite-pattern set exact string matching task)
Jump to navigation
Jump to search
A Finite-Pattern Set Exact String Matching Task is an Exact String Matching Task that involves a finite non-unitary String Pattern Set.
- Context:
- Task Input: a String.
- Task Input: a Finite Set of Lexical String Patterns.
- It can be solved by a Finite-Pattern Set Exact String Matching System (that implements a Finite-Pattern Set Exact String Matching Algorithm).
- …
- Example(s):
- Find the Substrings within the text in a Text Dictionary.
- …
- See: Finite-Pattern Set Inexact String Matching Algorithm.
References
1975
- (Aho & Corasick, 1975) ⇒ Alfred V. Aho, and Margaret J. Corasick. (1975). “Efficient String Matching: An aid to bibliographic search.” In: Communications of the ACM, 18(6). doi:10.1145/360825.360855
- QUOTE: This paper describes a simple, efficient algorithm to locate all occurrences of any of a finite number of keywords in a string of text.