article · International Journal of Information Technology and Computer Science · 2017

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

Dipendra Gurung, Udit Kr. Chakraborty, Pratikshya Sharma

Cited by 5Open access

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.

Cite this paper

APA 7

Gurung, D., Chakraborty, U. K., & Sharma, P. (2017). An analysis of the Intelligent Predictive String Search Algorithm: A Probabilistic Approach. International Journal of Information Technology and Computer Science, 9(2), 66–75. https://doi.org/10.5815/ijitcs.2017.02.08

MLA 9

Gurung, Dipendra, et al. “An analysis of the Intelligent Predictive String Search Algorithm: A Probabilistic Approach.” International Journal of Information Technology and Computer Science, vol. 9, no. 2, 2017, pp. 66–75, https://doi.org/10.5815/ijitcs.2017.02.08.

Chicago

Gurung, Dipendra, Udit Kr. Chakraborty, and Pratikshya Sharma. 2017. “An analysis of the Intelligent Predictive String Search Algorithm: A Probabilistic Approach.” International Journal of Information Technology and Computer Science 9 (2): 66–75. https://doi.org/10.5815/ijitcs.2017.02.08.

Harvard

Gurung, D., Chakraborty, U.K. and Sharma, P. (2017) ‘An analysis of the Intelligent Predictive String Search Algorithm: A Probabilistic Approach’, International Journal of Information Technology and Computer Science, 9(2), pp. 66–75. Available at: https://doi.org/10.5815/ijitcs.2017.02.08.

BibTeX

@article{gurung2017analysis,
  title = {{An analysis of the Intelligent Predictive String Search Algorithm: A Probabilistic Approach}},
  author = {Gurung, Dipendra and Chakraborty, Udit Kr. and Sharma, Pratikshya},
  journal = {International Journal of Information Technology and Computer Science},
  volume = {9},
  number = {2},
  pages = {66--75},
  year = {2017},
  doi = {10.5815/ijitcs.2017.02.08}
}

Made from the index record. Check names, capitalisation and page numbers against the paper. Need another style? AI for Research has over 10,000.