Approximate String Matching is implemented using Levenshtein distance algorithm. The strings present in example set is matched with the text in the document and respective matching percentage is shown in result if it's greater than Threshold percentage. Works for strings with or without whitespace.