code: def find_near_matches(subsequence, sequence,
                        max_substitutions=None,
                        max_insertions=None,
                        max_deletions=None,
                        max_l_dist=None):
      
      search_params = LevenshteinSearchParams(max_substitutions,
                                              max_insertions,
                                              max_deletions,
                                              max_l_dist)
      search_func = choose_search_func(search_params)
      return search_func(subsequence, sequence, search_params)
docs: search for near-matches of subsequence in sequence
  
      This searches for near-matches, where the nearly-matching parts of the
      sequence must meet the following limitations (relative to the subsequence):
  
      * the maximum allowed number of character substitutions
      * the maximum allowed number of new characters inserted
      * and the maximum allowed number of character deletions
      * the total number of substitutions, insertions and deletions
        (a.k.a. the Levenshtein distance)