An Efficient Word Searching Algorithm through Splitting and Hashing the Offline Text

Word matching problem is to find all the occurrences of a pattern P[0...m-1] in the text T[0...n-1], where P neither contains any white space nor preceded and followed by space. In this paper, we assume that our text is offline. Ibrahiem et al. in 2008 have proposed an algorithm (WSA) for solving the word matching problem by splitting the offline text into number of tables in the preprocessing phase. The main drawback of this algorithm was: after splitting the text into a number of tables, they search each occurrence of the pattern by the brute force manner in each table. In this paper, we improved the algorithm by using an efficient hash function SDBM proposed by R. J. Enbody et al. in 1988. In this technique, after splitting the text into number of tables, we match the hash value of the pattern P with the hash values of the words of same length in the text T. This algorithm is called as modified word searching algorithm (MWSA). Experimental results show that MWSA algorithm is much faster than the previously proposed WSA algorithm.