{'fraction_non_alphanumeric': 0.012411347517730497, 'fraction_numerical': 0.0, 'mean_word_length': 5.4147727272727275, 'pattern_counts': {'":': 0, '<': 0, '<?xml version=': 0, '>': 0, 'https://': 0, 'lorem ipsum': 0, 'www.': 0, 'xml': 0}, 'pii_count': 0, 'substrings_counts': 0, 'word_list_counts': {'cursed_substrings.json': 0, 'profanity_word_list.json': 0, 'sexual_word_list.json': 0, 'zh_pornsignals.json': 0}}
An Exact matching approach to enhance retrieval process for Quranic texts

The most popular algorithms used in searching texts involves Exact matching algorithms. These algorithms are used in the areas of natural language processing, networking, and bioinformatics. Boyer Moore algorithm is one of the most widely in searching texts. However, the performance of the Boyer-Moore algorithm and existing exact matching algorithms degrade for Arabic texts, especially for very short patterns. The reason for poor performance is involvement of diacritics in Arabic texts like Digital Quran and involvement of shifting phases in exact matching algorithms. To overcome the time complexity of Arabic Diacritical texts, we present a simple enhanced version of Brute force approach. The proposed algorithm divides the given pattern p into two equal halves and looks for second half only during the search process. Initial experimental results on natural language texts for very short patterns showed that the proposed algorithm showed significant improvement in terms of time complexity over existing approaches and is highly competitive.