Uses Levenshtein Distance to find the closest string match or matches in an array
Word search algorithms