Projected implemented 4 different Top K Sub string matching algorithms from a conference paper using the dblp dataset.There is a wide range of applications that require to query a large database of texts to search for similar strings or substrings. Traditional approximate substring matching requests a user to specify a similarity threshold