Open AccessA new split based searching for exact pattern matching for natural texts
Author(s) -
Saqib Hakak,
Amirrudin Kamsin,
Palaiahnakote Shivakumara,
Mohd Yamani Idna Idris,
Gulshan Amin Gilkar
Publication year - 2018
Publication title -
plos one
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.99
H-Index - 332
ISSN - 1932-6203
DOI - 10.1371/journal.pone.0200912
Subject(s) - computer science , string searching algorithm , pattern matching , commentz walter algorithm , focus (optics) , string (physics) , boyer–moore string search algorithm , intrusion detection system , matching (statistics) , search engine , algorithm , data mining , theoretical computer science , pattern recognition (psychology) , artificial intelligence , information retrieval , mathematics , statistics , physics , optics , mathematical physics
Exact pattern matching algorithms are popular and used widely in several applications, such as molecular biology, text processing, image processing, web search engines, network intrusion detection systems and operating systems. The focus of these algorithms is to achieve time efficiency according to applications but not memory consumption. In this work, we propose a novel idea to achieve both time efficiency and memory consumption by splitting query string for searching in Corpus. For a given text, the proposed algorithm split the query pattern into two equal halves and considers the second (right) half as a query string for searching in Corpus. Once the match is found with second halves, the proposed algorithm applies brute force procedure to find remaining match by referring the location of right half. Experimental results on different S1 Dataset , namely Arabic, English, Chinese, Italian and French text databases show that the proposed algorithm outperforms the existing S1 A lgorithm in terms of time efficiency and memory consumption as the length of the query pattern increases.