An analysis of the Intelligent Predictive String Search Algorithm: A Probabilistic Approach

Abstract

Abstract-Due to the huge surge of digital information and the task of mining valuable information from huge amount of data, text processing tasks like string search has gained importance. Earlier techniques for text processing relied on following some predetermined sequence of steps or some hard coded rules. However, these techniques might soon prove to be inefficient as the amount of data generated by modern computer systems in increasing more and more. One solution to this problem lies in the development of intelligent algorithms that incorporate a certain degree of intelligence and unlike traditional algorithm are able to cope up with changing scenarios. This paper presents a string searching algorithm that incorporates a certain degree of intelligence to search for a string in a text. In the search of a string, the algorithm relies on a chance process and a certain probability at each step. An analysis of the algorithm based on the approach suggested by A. A. Markov is also presented in the paper. The expected number of average comparisons required for searching a string in a text is computed. Based on the varieties of applications that are coming up in the area of text processing and the related fields, this new algorithm aims to find its use.

Mobile-Based Word Matching Detection using Intelligent Predictive Algorithm

“…A string search algorithm takes a text and a pattern, as the inputs and finds the first or all the occurrences of the pattern. The algorithm will check whether the string pattern for the searched word is appear or not in the text document that is referred [5][6][7][8][9]. If the word is matches, it will return to where the position of the word occurs in the text.…”

“…However, these algorithms facing numerous issues especially in measuring the performance of the algorithms. The number of comparisons, comparison time and search space requirements are among the important issues to handle in measuring the performance of the algorithms [5][6][7]. Intelligent Predictive (IP) algorithm capable to solve several issues in word matching especially it can skip the pre-processing of the pattern, uses simple rules during matching process and it does not involve complex computations [5][6].…”

“…The number of comparisons, comparison time and search space requirements are among the important issues to handle in measuring the performance of the algorithms [5][6][7]. Intelligent Predictive (IP) algorithm capable to solve several issues in word matching especially it can skip the pre-processing of the pattern, uses simple rules during matching process and it does not involve complex computations [5][6]. Due to those reasons, this study proposed Intelligent Predictive (IP) algorithm as the searching that proven can perform better performance in word matching process especially for the number of comparison [6].…”

“…Intelligent Predictive (IP) algorithm capable to solve several issues in word matching especially it can skip the pre-processing of the pattern, uses simple rules during matching process and it does not involve complex computations [5][6]. Due to those reasons, this study proposed Intelligent Predictive (IP) algorithm as the searching that proven can perform better performance in word matching process especially for the number of comparison [6]. This algorithm uses intelligent predictive analysis based on text features for string searching in text by finding the first occurrence of the pattern in text that consists of words that separated by blank space.…”

Development of Relevance Feedback System using Regression Predictive Model and TF-IDF Algorithm

“…As the volume of information on the internet explodes leading to information overload [1], finding and retrieving relevant web documents is a challenge. This problem has led to vast research on information retrieval.…”