combining the 2 approaches of longest common subsequence and levenshten distance seems to work for the best