code: def levenshtein(x, y):
      """
      Compute the Levenshtein distance between between strings. The
      distance is the number of insertion, deletion, and substitution edits
      needed to transform string `x` into string `y`. The mathematical
      definition of Levenshtein is recursive:
  
      .. math::
  
          D(x, y) = d(|x|, |y|)
  
          d(i, j) = \\max(i, j), \\quad \\mathrm{if } \\min(i, j) = 0
  
          d(i, j) = \\min \\Big \\{d(i-1, j) + 1, \\ d(i, j-1) + 1, \\ d(i-1, j-1) + I(x_i \\neq y_i) \\Big \\}, \\quad \\mathrm{else}
  
  
      Parameters
      ----------
      x : string
          First input string.
  
      y : string
          Second input string.
  
      Returns
      -------
      out : float
          Levenshtein distance between `x` and `y`.
  
      References
      ----------
      - `Wikipedia - Levenshtein distance
        <http://en.wikipedia.org/wiki/Levenshtein_distance>`_
  
      Examples
      --------
      >>> tc.distances.levenshtein("fossa", "fossil")
      2.0
      """
      return _tc.extensions._distances.levenshtein(x, y)
  
file_path: turicreate/src/python/turicreate/toolkits/distances/_distances.py
imports: from __future__ import print_function
  from __future__ import division
  from __future__ import absolute_import
  import turicreate
label_desc: Use image node_id 6 for calling a global function with example usage: levenshtein(x, y) and returns: _tc