AbcAeffchen

-- store this as a procedure lv_leq_2. To be able to call this "revursivly" 
-- you have to add this function a second time named lv_leq_1. lv_leq_0 stopps
-- the recursion and just compares if two strings are equal.

BEGIN
  DECLARE s1_len, s2_len, i INT;
  SET s1_len = CHAR_LENGTH(s1), s2_len = CHAR_LENGTH(s2), i = 1;
  IF s1 = s2 THEN
    RETURN TRUE;
  ELSEIF ABS(s1_len - s2_len) > 3 THEN

AbcAeffchen

Keybase proof

I hereby claim:

• I am abcaeffchen on github.
• I am alex_schickedanz (https://keybase.io/alex_schickedanz) on keybase.
• I have a public key ASDhQZRF5WxZahE6TWCAVU8SXXOLR9nYYgzNBe6wmo6EKwo

To claim this, I am signing this object: