A New Approach for Solving String Matching Problem through Splitting the Unchangeable Text
Ibrahiem M. M. El Emary, Mohammed S. M. Jaber · 2008
This paper describes a new approach for solving string pattern matching problem with splitting unchangeable text in order to speed up the string pattern matching task The string matching problem consists of finding one or more generally all the exact or partial occurrences of a pattern P in a text T. So, this paper presents a new algorithm to solve the string matching problem. Application of the proposed algorithm assists in improving the search process of a specific pattern in a certain unchangeable text through decreasing the number of character comparisons. Operation concept of such an algorithm depends on reading the text and do two things: first split the text to n parts depending on the text size and in the same time construct n tables consisting of two columns; the first one is the words lengths exists in the text and the second one is the start positions of each word classified by the same length. After that, reading the pattern to obtain the pattern length and the pattern first character then the algorithm searches just in the words that consists of the same length of each table.