Importance Of Matching In Matching

1325 Words3 Pages

String matching is very popular and an important technique which is widely used in information retrieval, text processing and in many other web related, and software applications. String matching simply states that a pattern string should be matched to the text string. String matching is used to determine the position of a pattern string in a text string and to find all or nearest strings correspond to pattern string. String matching is a technique, which is applied in real life applications as well. As the necessities arise, the need for technology is come around. It is applied in string matching also. As we know that many people are now aware of world of computers, internet and information technology, and because a large amount of data are …show more content…

In the different application areas like spell checking, intrusion detection system, bioinformatics applications, plagiarism detection, pattern identifying, document searching, text mining, video retrieval, data cleaning and so on, both the string-matching algorithms are applied. Different functions, concepts, and approaches are applied to both types of the algorithms to achieve optimum and efficient results. String matching is very important for this generation because most of the information has become online and millions of people are aware of internet so searching any information in the search engines is very convenient now with the help of the string- matching …show more content…

String matching algorithms have different categories. We have explained above about two types of string matching exact and approximate string matching but here we are telling about the multiple string algorithms which are applied in multiple patterns and multiple texts. In multiple string matching we are given a text T = t1, t2,....,tn and want to search simultaneously for a set of strings P = {p1, p2, … pr} Where pi=pi1 pi2………… pi mi is a string of length mi, for i=1…..r. [9] The text T = t1,t2,...,tn is a string of n characters in an alphabet of size c. There are r patterns P1, P2 . . ., Pr of length m in the same alphabet. If the lengths of the patterns are not equal, then substring is selected from each pattern according to the length of the shortest pattern. All exact occurrences of the patterns should be retrieved.[29 ] There are many algorithms used for multi pattern searching. Some of them are Aho–Corasick algorithm, Commentz-Walter algorithm [19], The Set Horspool algorithm

More about Importance Of Matching In Matching

Open Document