input: def find_matches(query: str, choices: List[str], threshold: int) -> List[str]:
      """ Generate a fuzzy search algorithm that matches strings with near similarities based on Levenshtein distance.
      >>> find_matches("apple", ["appel", "pineapple", "apples"], 2)
      ['appel', 'apples']
      >>> find_matches("fuzzy", ["fizzy", "buzz", "fuzzywuzzy"], 3)
      ['fizzy', 'fuzzywuzzy']
      """
output:     from Levenshtein import distance
      return [choice for choice in choices if distance(query, choice) <= threshold]