One-Match and All-Match Categories for Keywords Matching in Chatbot

Lokman, Abbas Saliimi; Zain, Jasni Mohamad

doi:10.3844/ajassp.2010.1406.1411

Cited by 15 publications

(2 citation statements)

References 7 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…In modern times string search algorithms continues to play a vital role for searching string applications (Almazroi and Rashid, 2011) specifically searching and matching patterns from vast and multifaceted science data. The goal of string matching algorithms (Raju and Babu, 2007;Lokman and Zain, 2010) is to discover all the occurrences of a specific known pattern Y= y1y2…ym in a text Z=z1z2…zn. The operations for all string algorithms entail the initial process by aligning the left last positions of the pattern and also the text, after that comparison is among the text and the pattern characters (Mohamed et al, 2010).…”

Section: Introductionmentioning

confidence: 99%

A Fast Hybrid Algorithm Approach for the Exact String Matching Problem Via Berry Ravindran and Alpha Skip Search Algorithms

Almazroi¹

2011

Journal of Computer Science

View full text Add to dashboard Cite

Problem statement: String matching algorithm had been an essential means for searching biological sequence database. With the constant expansion in scientific data such as DNA and Protein; the development of enhanced algorithms have even become more critical as the major concern had always been how to raise the performances of these search algorithms to meet challenges of scientific information. Approach: Therefore a new hybrid algorithm comprising Berry Ravindran (BR) and Alpha Skip Search (ASS) is presented. The concept is based on BR shift function and combines with ASS to ensure improved performance. Results: The results obtained in percentages from the proposed hybrid algorithm displayed superior results in terms of number of attempts and number of character comparisons than the original algorithms when various types of data namely DNA, Protein and English text are applied to appraise the hybrid performances. The enhancement of the proposed hybrid algorithm performs better at 71%, 60% and 63% when compared to Berry-Ravindran in DNA, Protein and English text correspondingly. Moreover the rate of enhancement over Alpha Skip Search algorithm in DNA, Protein and English text are 48%, 28% and 36% respectively. Conclusion: The new proposed hybrid algorithm is relevant for searching biological science sequence database and also other string search systems

show abstract

Section: Introductionmentioning

confidence: 99%

A Fast Hybrid Algorithm Approach for the Exact String Matching Problem Via Berry Ravindran and Alpha Skip Search Algorithms

Almazroi¹

2011

Journal of Computer Science

View full text Add to dashboard Cite

show abstract

“…The Naïve search (brute-force) is the simplest and the less efficient algorithm among string matching algorithms (Lokman and Zain, 2010). Bruteforce algorithm is simple to implement, need no preprocessing of text and always find the result if it is exists.…”

Section: Introductionmentioning

confidence: 99%

First Token Algorithm for Searching Compound Terms Using Thesaurus Database

Abuzir¹

2012

Journal of Computer Science

View full text Add to dashboard Cite

Problem statement: Searching text materials is the one of the most important operations that carried out by search engines either on web or desktop applications, searching algorithms are required sometimes to find a specific word into a text, others to find a multi word term (pattern matching) into a text. Searching for term into a thesaurus database can be carried out using many searching algorithm such as brute-force algorithm and others. Approach: We addressed several issues concerning developing a searching algorithm that search terms into thesaurus database. Two exact algorithms were discussed and compared. The first algorithm, brute-force algorithm and the second one were proposed by this study to enhance brute-force algorithm. Results: We proposed an efficient search algorithm and compare it with brute force technique. Computational results showed that our algorithm can provide an efficient search algorithm that reduces the number of queries and the total time required to finish the required task. Conclusion: Our study showed an optimum solution for larger size of the studied problem with much less processing time than the brute-force algorithm. The modified algorithm has a higher efficiency to deal with Thesaurus Database searching problems.

show abstract