A Comparison of Different Algorithms for Approximate String Matching.

In computer science, approximate string matching is the technique of finding strings that match a pattern approximately (rather than exactly). Most often when we need to match a pattern exact matching is not possible, due to insufficient data, broken data, or other such reasons. So we try to find a close match instead of an exact match. And for this we need to find the distance between two strings. We have different approaches for the same such as edit distance in the form of Hamming distance, Levenshstien distance, Dameru-Levenshstein distance, Jaro-Winkler distance and Longest Common Subsequence (LCS). Different algorithms have been made for these different approaches, and we will try to analyze some of these algorithms. [ABSTRACT FROM AUTHOR]