1 / 12

Construction of Aho Corasick Automaton in Linear Time for Integer Alphabets Shiri Dori

Construction of Aho Corasick Automaton in Linear Time for Integer Alphabets Shiri Dori Gad M. Landau. Aho-Corasick Automaton: Goto Function (trie) Failure Function Nodes with output. her. . 1. 4. 12. 7. e. h. i. t. 11. 2. 13. 8. 5. ey. he. ir. is. th. 9. 3. 6. 14.

della
Download Presentation

Construction of Aho Corasick Automaton in Linear Time for Integer Alphabets Shiri Dori

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript

  1. Construction of Aho Corasick Automaton in Linear Time for Integer Alphabets Shiri Dori Gad M. Landau

  2. Aho-Corasick Automaton: Goto Function (trie) Failure Function Nodes with output her  1 4 12 7 e h i t 11 2 13 8 5 ey he ir is th 9 3 6 14 eye her iri the 10 15 iris thei 16 their P = {her, their, eye, iris, he, is}

  3. Goto function • Failure function • Output function

  4. Goto Step 1: Sort the words, Using Suffix Arrays SP= $her$their$eye$iris$he$is$ eye, he, her, iris, is, their

  5. Step 2 – Build the Trie Than, The, There, This T H A I E N R S E

  6. Goto in O(N) time

  7. Failure function SP=$HE$END$THE$ In O(n) time SPR=$EHT$DNE$EH$ Suffix Tree (SPR) DNE$ T$ E H T E$ NE$ N H$ H E D E EH$ HT$ EHT$

  8. $ z  p a e g j n q e (e) h (h) i (i) r (r) si (is) t (t) ye (ey) b h i k l o d f $ $ $ $ $ $ eh (he) eye (eye) ht (th) ieht (thei) iri (iri) reh (her) ri (ir) siri (iris) c m $ $ $ $ $ $ $ $ eht (the) rieht (their) $ $ TR, the reverse suffix tree: Suffix Tree Links Endmarker Node with no Endmarker $ P = {her, their, eye, iris, he, is} r

  9. Aho-Corasick Automaton: Goto Function (trie) Failure Function Nodes with output her  1 4 12 7 e h i t 11 2 13 8 5 ey he ir is th 9 3 6 14 eye her iri the 10 15 iris thei 16 their P = {her, their, eye, iris, he, is}

  10. (a) (b) (c) P = {her, their, eye, iris, he, is}

  11. Than, The, There, This T H A I E N R S E

  12. END

More Related