Abstract
The study presents an algorithm for precise index-based multiple pattern matching which detects Quranic verses in a text and pinpoints them. To be sufficiently precise, Arabic diacritical symbols are removed from the input text, and then a unique algorithm changes the detected strings into indices and detects Quranic verses by focusing on indices consecutiveness. To accelerate the function, the stored strings in databanks were decreased from 84845 to 13362 strings; therefore, the search speed increased. The proposed Quranic algorithm is used for text analysis, and information retrieval criteria such as recall and precision and F criteria have been used to evaluate it. The results suggest that they had a profound impact on the efficiency of the algorithm.
Highlights
Nowadays, access to information sources has been very easy
This study aims to retrieve Quranic verses in different texts
The present paper aims to propose a method to search and retrieve Quranic verses from different texts
Summary
Texts used to be books, journals, and so on which followed clear syntactical and diacritical rules; today it is not the case, as texts and books are turned digital, and Internet sources are available. The proposed algorithm in our system makes use of text analysis techniques and ensures precise multiple pattern matching to detect verses in various texts properly and precisely. This algorithm finds Quranic verses as fast as possible and at the same time it maintains the sufficient recall and precision. It is one the most important challenges which has to be encountered
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.