Editing Aho–Corasick algorithm (section)

==Dynamic search list==

The original Aho–Corasick algorithm assumes that the set of search strings is fixed. It does not directly apply to applications in which new search strings are added during application of the algorithm. An example is an interactive indexing program, in which the user goes through the text and highlights new words or phrases to index as they see them. [[Bertrand Meyer]] introduced an incremental version of the algorithm in which the search string set can be incrementally extended during the search, retaining the algorithmic complexity of the original.<ref>{{cite journal |first1=Bertrand |last1=Meyer |authorlink=Bertrand Meyer |date=1985 |title=Incremental string matching |journal=Information Processing Letters |volume=21 |issue=5 |pages=219&ndash;227 | doi=10.1016/0020-0190(85)90088-2 | url=http://se.ethz.ch/~meyer/publications/string/string_matching.pdf}}</ref>