input: `python
  from typing import List
  
  def find_matches(query: str, choices: List[str], threshold: int) -> List[str]:
      """
      This function takes a query string, a list of choices, and a threshold value for 
      Levenshtein distance. It returns a list of strings from the choices that have a 
      Levenshtein distance to the query string less than or equal to the threshold.
  
      >>> find_matches("apple", ["aple", "appl", "app", "pple"], 2)
      ['aple', 'appl', 'pple']
      >>> find_matches("python", ["py", "pyhton", "pyt", "thpnoy"], 3)
      ['pyhton']
      """
  `
output:     from Levenshtein import distance
      
      matches = []
      for choice in choices:
          if distance(query, choice) <= threshold:
              matches.append(choice)
      
      return matches