PARTITION-BASED PATTERN MATCHING APPROACH FOR EFFICIENT RETRIEVAL OF ARABIC TEXT

Main Article Content

Saqib Hakak Amirrudin Kamsin Palaiahnakote Shivakumara Mohd. Yamani Idna Idris

Abstract

Encoding for Arabic based on the Unicode Transformation Format (UTF) differs from encoding for English based on the American Standard Code for Information Interchange (ASCII) since the Arabic usage of diacritics, symbols and elongated characters makes searching more challenging in the field of information retrieval. In this paper, we propose a new partition-based pattern matching approach that divides the query words into two equal parts (sub-parts). The proposed approach treats the two divided sub-parts as independent query words and uses a parallel search to match the content in the database. In addition, the proposed approach modifies the conventional brute force pattern matching to speed up the searching process which results in efficient text retrieval from any database. The experimental results are used to evaluate the proposed approach in terms of processing time. The comparative analysis of the existing approaches and the proposed approach reveals that the proposed approach outperforms all other existing approaches in terms of computational time.

Article Details

How to Cite
HAKAK, Saqib et al. PARTITION-BASED PATTERN MATCHING APPROACH FOR EFFICIENT RETRIEVAL OF ARABIC TEXT. Malaysian Journal of Computer Science, [S.l.], v. 31, n. 3, p. 200-209, july 2018. ISSN 0127-9084. Available at: <https://ejournal.um.edu.my/index.php/MJCS/article/view/12732>. Date accessed: 18 aug. 2018. doi: https://doi.org/10.22452/mjcs.vol31no3.3.
Section
Articles