input: def find_matches(query: str, choices: List[str], threshold: int) -> List[str]:
      """Generates a list of strings that are within a certain threshold of similarity
      to a given query string using the Levenshtein distance.
  
      >>> find_matches("apple", ["aple", "appel", "appeal", "apples"], 2)
      ["aple", "appel"]
      >>> find_matches("Python", ["Python3", "pyhton", "PYTHO", "java"], 1)
      ['pyhton', 'PYTHO']
      """
output:     from Levenshtein import distance
      return [choice for choice in choices if distance(query, choice) <= threshold]