= Margaret J. Corasick
{c}
<Margaret J. Corasick> coauthored the 1975 multi-keyword matching algorithm with <Alfred V. Aho>. Their <Aho-Corasick algorithm> builds a finite-state keyword-matching machine and scans the <string>[text] once, reporting occurrences of all dictionary <string>[patterns].<Efficient String Matching: An Aid to Bibliographic Search by Alfred V. Aho and Margaret J. Corasick>[abstract]{ref}
A <trie> shares <string>[pattern] <string prefix>[prefixes], while <failure links> retain the longest useful <string suffix>[suffix] after a mismatch. For <string>[patterns] `he` and `she`, reaching the end of `she` must also report `he`; terminal <string suffix>[suffix] information is therefore part of matching, not merely following <trie> edges. The mechanism makes one <string>[text] scan reusable across many search <first-order term>[terms].
Back to article page
