Efficient Parameterized Word Matching Using Bit-Parallelism and Partitioning the Text

  • Rajesh Prasad Department of Computer Science, Yobe State University, Damaturu, Nigeria

Abstract

Word matching problem is to find all the exact 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 the parameterized word matching problem, a given word P[0...m-1] is said to match with a sub-word t of the text T[0...n-1], if there exists a one-to-one correspondence between the symbols of P and the symbols of t. Exact Word Matching (EWM) problem has been previously solved by partitioning the text into number of tables in the pre-processing phase and then applying either brute force approach or fast hashing during the searching process. This paper presents an extension of EWM problem for parameterized word matching. It first split the text into number of tables in the pre-processing phase and then applying prev-encoding and bit-parallelism technique, Parameterized Shift-Or (PSO) during the searching phase. Experimental results show that this technique performs better than PSO.

Published
Jun 15, 2016
How to Cite
PRASAD, Rajesh. Efficient Parameterized Word Matching Using Bit-Parallelism and Partitioning the Text. International Research Journal of Electronics and Computer Engineering, [S.l.], v. 2, n. 2, p. 20-24, june 2016. ISSN 2412-4370. Available at: <https://www.researchplusjournal.com/index.php/IRJECE/article/view/164>. Date accessed: 05 aug. 2026. doi: http://dx.doi.org/10.24178/irjece.2016.2.2.20.