The exact online string matching problem

Faro, Simone; Lecroq, Thierry

doi:10.1145/2431211.2431212

Cited by 115 publications

(19 citation statements)

References 71 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…However, in order to understand the methodology of above-tested algorithms including S1 Algorithm , it is must to have a good understanding of Boyer-Moore (BM) algorithm. Boyer-Moore algorithm [ 29 , 33 ] starts searching characters from right to left of the given pattern. In case of a mismatch, it shifts as many as m characters as shown in Fig 8 .…”

Section: Proposed Approachmentioning

confidence: 99%

Residual-based approach for authenticating pattern of multi-style diacritical Arabic texts

et al. 2018

View full text Add to dashboard Cite

Arabic script is highly sensitive to changes in meaning with respect to the accurate arrangement of diacritics and other related symbols. The most sensitive Arabic text available online is the Digital Qur’an, the sacred book of Revelation in Islam that all Muslims including non-Arabs recite as part of their worship. Due to the different characteristics of the Arabic letters like diacritics (punctuation symbols), kashida (extended letters) and other symbols, it is written and available in different styles like Kufi, Naskh, Thuluth, Uthmani, etc. As social media has become part of our daily life, posting downloaded Qur’anic verses from the web is common. This leads to the problem of authenticating the selected Qur’anic passages available in different styles. This paper presents a residual approach for authenticating Uthmani and plain Qur’an verses using one common database. Residual (difference) is obtained by analyzing the differences between Uthmani and plain Quranic styles using XOR operation. Based on predefined data, the proposed approach converts Uthmani text into plain text. Furthermore, we propose to use the Tuned BM algorithm (BMT) exact pattern matching algorithm to verify the substituted Uthmani verse with a given database of plain Qur’anic style. Experimental results show that the proposed approach is useful and effective in authenticating multi-style texts of the Qur’an with 87.1% accuracy.

show abstract

Section: Proposed Approachmentioning

confidence: 99%

Residual-based approach for authenticating pattern of multi-style diacritical Arabic texts

et al. 2018

View full text Add to dashboard Cite

show abstract

“…These methods generally achieve better results yet consume more memory due to the necessary state diagram construction and traversal. The final approach, bitparallelism, involves parallel processing to speed up the matching process [19,20]. However, it requires dividing the task into sub-tasks.…”

Section: Literature Reviewmentioning

confidence: 99%

“…However, the same algorithm can perform faster on more advanced machines where instruction set and processing speed is massively increased. Our proposed approach is based on same assumption that brute force algorithms can perform better on modern machines for UTF based texts like Arabic [18][19][20].…”

Section: Literature Reviewmentioning

confidence: 99%

Partition-Based Pattern Matching Approach for Efficient Retrieval of Arabic Text

Hakak

Kamsin

Shivakumara

et al. 2018

MJCS

View full text Add to dashboard Cite

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.

show abstract

“…BM is one of the most standard and widely used algorithms in pattern matching and a lot of improvement in terms of time efficiency was carried out by post researchers to this very concept of character shifts. Few existing string matching algorithms using the same concept include fast search searching algorithm [ 8 ], modified Boyer Moore algorithm[ 9 , 10 ], Horspool algorithm [ 11 ], Tuned BM [ 6 ], Turbo BM [ 12 ], SSM Algorithm [ 4 ] and so on [ 9 , 10 ].…”

Section: Introductionmentioning

confidence: 99%

A new split based searching for exact pattern matching for natural texts

et al. 2018

View full text Add to dashboard Cite

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 Algorithm in terms of time efficiency and memory consumption as the length of the query pattern increases.

show abstract

The exact online string matching problem

Cited by 115 publications

References 71 publications

Residual-based approach for authenticating pattern of multi-style diacritical Arabic texts

Residual-based approach for authenticating pattern of multi-style diacritical Arabic texts

Partition-Based Pattern Matching Approach for Efficient Retrieval of Arabic Text

A new split based searching for exact pattern matching for natural texts

Contact Info

Product

Resources

About