NobleBlocks
Public

Efficient string matching

Published in Communications of the ACM • Jun 1, 1975
Authors:
Alfred V. Aho
,
Margaret J. Corasick

Abstract

This paper describes a simple, efficient algorithm to locate all occurrences of any of a finite number of keywords in a string of text. The algorithm consists of constructing a finite state pattern matching machine from the keywords and then using the pattern matching machine to process the text str...

Finding related papers...

Discussions

(0)

No comments yet

Be the first to share your thoughts!