Aho-Korasik search algorithm implements a plurality of substrings from the dictionary in the given string. The algorithm builds as Finite-state machine, which then sends the search string. The machine receives all queue lines symbols and clicking on the edges. If the machine has come to the end position, the corresponding row of the dictionary is present in the line.