def levenshtein(s1, s2):
    if len(s1) < len(s2):
        return levenshtein(s2, s1)

    # len(s1) >= len(s2)
    if len(s2) == 0:
        return len(s1)

    previous_row = range(len(s2) + 1)
    for i, c1 in enumerate(s1):
        current_row = [i + 1]
        for j, c2 in enumerate(s2):
            insertions = previous_row[j + 1] + 1  # j+1 instead of j since previous_row and current_row are one character longer
            deletions = current_row[j] + 1        # than s2
            substitutions = previous_row[j] + (c1 != c2)
            current_row.append(min(insertions, deletions, substitutions))
        previous_row = current_row

    return previous_row[-1]

def levenshtein(top_string, bot_string):
    if len(top_string) < len(bot_string):
        return levenshtein(bot_string, top_string)

    # len(s1) >= len(s2)
    if len(bot_string) == 0:
        return len(top_string)

    previous_row = range(len(bot_string) + 1)
    for i, top_char in enumerate(top_string):
        current_row = [i + 1]
        for j, bot_char in enumerate(bot_string):
            insertions = previous_row[j + 1] + 1  # j+1 instead of j since previous_row and current_row are one character longer
            deletions = current_row[j] + 1        # than bot_string
            substitutions = previous_row[j] + (top_char != bot_char)
            current_row.append(min(insertions, deletions, substitutions))
        previous_row = current_row

    return previous_row[-1]

Use better variable names for algorithmic determination
Use better variable names for algorithmic determination

- def levenshtein(s1, s2):
-     if len(s1) < len(s2):
+ def levenshtein(top_string, bot_string):
+     if len(top_string) < len(bot_string):
-         return levenshtein(s2, s1)
+         return levenshtein(bot_string, top_string)
  
      # len(s1) >= len(s2)
-     if len(s2) == 0:
+     if len(bot_string) == 0:
-         return len(s1)
+         return len(top_string)
  
-     previous_row = range(len(s2) + 1)
+     previous_row = range(len(bot_string) + 1)
-     for i, c1 in enumerate(s1):
+     for i, top_char in enumerate(top_string):
          current_row = [i + 1]
-         for j, c2 in enumerate(s2):
+         for j, bot_char in enumerate(bot_string):
              insertions = previous_row[j + 1] + 1  # j+1 instead of j since previous_row and current_row are one character longer
-             deletions = current_row[j] + 1        # than s2
+             deletions = current_row[j] + 1        # than bot_string
-             substitutions = previous_row[j] + (c1 != c2)
+             substitutions = previous_row[j] + (top_char != bot_char)
              current_row.append(min(insertions, deletions, substitutions))
          previous_row = current_row
  
      return previous_row[-1]
  
Use better variable names for algorithmic determination
## Code Before:
def levenshtein(s1, s2):
    if len(s1) < len(s2):
        return levenshtein(s2, s1)

    # len(s1) >= len(s2)
    if len(s2) == 0:
        return len(s1)

    previous_row = range(len(s2) + 1)
    for i, c1 in enumerate(s1):
        current_row = [i + 1]
        for j, c2 in enumerate(s2):
            insertions = previous_row[j + 1] + 1  # j+1 instead of j since previous_row and current_row are one character longer
            deletions = current_row[j] + 1        # than s2
            substitutions = previous_row[j] + (c1 != c2)
            current_row.append(min(insertions, deletions, substitutions))
        previous_row = current_row

    return previous_row[-1]

## Instruction:
Use better variable names for algorithmic determination
## Code After:
def levenshtein(top_string, bot_string):
    if len(top_string) < len(bot_string):
        return levenshtein(bot_string, top_string)

    # len(s1) >= len(s2)
    if len(bot_string) == 0:
        return len(top_string)

    previous_row = range(len(bot_string) + 1)
    for i, top_char in enumerate(top_string):
        current_row = [i + 1]
        for j, bot_char in enumerate(bot_string):
            insertions = previous_row[j + 1] + 1  # j+1 instead of j since previous_row and current_row are one character longer
            deletions = current_row[j] + 1        # than bot_string
            substitutions = previous_row[j] + (top_char != bot_char)
            current_row.append(min(insertions, deletions, substitutions))
        previous_row = current_row

    return previous_row[-1]
