code: def Levenshtein_Distance(w1, w2):
          
          m, n = len(w1), len(w2)
          v1 = [i for i in range(n + 1)]
          v2 = [0 for i in range(n + 1)]
  
          for i in range(m):
              v2[0] = i + 1
  
              for j in range(n):
                  delCost = v1[j + 1] + 1
                  insCost = v2[j] + 1
  
                  subCost = v1[j]
                  if w1[i] != w2[j]: subCost += 1
  
                  v2[j + 1] = min(delCost, insCost, subCost)
              v1, v2 = v2, v1
  
          return v1[-1]
docs: Computes Levenshtein Distance between two words
  
          Args:
              :param w1: str
              :param w2: str
              :return: int
  
          Examples:
  
              >>> Levenshtein.Levenshtein_Distance('noctis', 'noctem')
              2
  
              >>> Levenshtein.Levenshtein_Distance('nox', 'nochem')
              4
  
              >>> Levenshtein.Levenshtein_Distance('orbis', 'robis')
              2