RB-Matcher: String Matching Technique

Authors: Rajender Singh Chillar, Barjesh Kochar

Abstract:

All Text processing systems allow their users to search a pattern of string from a given text. String matching is fundamental to database and text processing applications. Every text editor must contain a mechanism to search the current document for arbitrary strings. Spelling checkers scan an input text for words in the dictionary and reject any strings that do not match. We store our information in data bases so that later on we can retrieve the same and this retrieval can be done by using various string matching algorithms. This paper is describing a new string matching algorithm for various applications. A new algorithm has been designed with the help of Rabin Karp Matcher, to improve string matching process.

Keywords: Algorithm, Complexity, Matching-patterns, Pattern, Rabin-Karp, String, text-processing.

Digital Object Identifier (DOI): doi.org/10.5281/zenodo.1074579

References:

[1] Algorithm design and analysis by T.H Coreman .
[2] Algorithm design by Aho ulman and Hopcrafft
[3] www.algodesign.com
[4] Richard M.Karp. An Introduction to Randomized Algorithms. Discrete Applied mathematics,34:165-201,1991