input: def find_matches(query, choices, threshold):
      """Generate a fuzzy search algorithm that matches strings with near similarities based on Levenshtein distance.
      The algorithm should return all strings from the choices list that have a Levenshtein distance to the query string 
      less than or equal to the given threshold.
      >>> find_matches("apple", ["apple", "appel", "aple", "banana"], 2)
      ['apple', 'appel', 'aple']
      >>> find_matches("hello", ["helo", "hllo", "heoo", "world"], 1)
      ['helo', 'hllo']
      """
output:     from Levenshtein import distance
      return [choice for choice in choices if distance(query, choice) <= threshold]