Abstract: String matching and string edit distance are fundamental concepts in structural pattern recognition, record linkage and schema matching problems. In this paper, a hybrid string matching approach is introduced. Given two strings, x and y, the similarity of the strings is obtained by using a combination of affine gap method, TFIDF and a custom domain specific dictionary. We’ll show formal properties of the hybrid string matching approach, describe a procedure for its computation and give practical examples.