update(findClosestMatchIn): optimize checking of levenshtein

There's no need to check for levenshtein distances after a distance of 1 is found. If another distance of 1 is found, it wouldn't get replaced anyways.