input: def find_matches(query: str, choices: List[str], threshold: int) -> List[str]:
      """ Given a query string, a list of choice strings, and a threshold value, 
      this function performs a fuzzy search to find all choices that have a Levenshtein distance 
      from the query less than or equal to the threshold.
      
      >>> find_matches("apple", ["apples", "aple", "banana", "grape"], 2)
      ['apples', 'aple']
      >>> find_matches("cat", ["act", "catt", "at", "bat"], 1)
      ['act', 'catt']
      """
output:     from Levenshtein import distance
      return [choice for choice in choices if distance(query, choice) <= threshold]