class_docstr: Compute the absolute Levenshtein distance between the two sequences.
  The Levenshtein distance is the minimum number of edit operations necessary
  for transforming one sequence into the other. The edit operations allowed are:
  
      * deletion:     ABC -> BC, AC, AB
      * insertion:    ABC -> ABCD, EABC, AEBC..
      * substitution: ABC -> ABE, ADC, FBC..
  
  https://en.wikipedia.org/wiki/Levenshtein_distance
  TODO: https://gist.github.com/kylebgorman/1081951/9b38b7743a3cb5167ab2c6608ac8eea7fc629dca
class_docstr_tok: ["Compute","the","absolute","Levenshtein","distance","between","the","two","sequences",".","The","Levenshtein","distance","is","the","minimum","number","of","edit","operations","necessary","for","transforming","one","sequence","into","the","other",".","The","edit","operations","allowed","are",":","*","deletion",":","ABC","-",">","BC",",","AC",",","AB","*","insertion",":","ABC","-",">","ABCD",",","EABC",",","AEBC","..","*","substitution",":","ABC","-",">","ABE",",","ADC",",","FBC","..","https",":","\/\/en.wikipedia.org\/wiki\/Levenshtein_distance","TODO",":","https",":","\/\/gist.github.com\/kylebgorman\/1081951\/9b38b7743a3cb5167ab2c6608ac8eea7fc629dca"]
code: def __call__(self, s1: Sequence[T], s2: Sequence[T]) -> int:
      s1, s2 = self._get_sequences(s1, s2)
  
      result = self.quick_answer(s1, s2)
      if result is not None:
          assert isinstance(result, int)
          return result
  
      return self._cycled(s1, s2)
  
imports: from __future__ import annotations
  from collections import defaultdict
  from itertools import zip_longest
  from typing import Any, Sequence, TypeVar
  from .base import Base, BaseSimilarity
  from .types import SimFunc, TestFunc
label_desc: Use image node_id 4 for calling the Levenshtein obj's underlying member method code with example usage: obj.__call__(s1, s2) and returns: self, result