_="_=%c%s%c;printf _,34,_,34";printf _,34,_,34

class String
  def makepureascii
    # Please add replacements if necessary
    temp = self.gsub(/ä/,'ae').gsub(/ö/,'oe').gsub(/ü/,'ue').gsub(/Ä/,'Ae')
    temp = temp.gsub(/Ö/,'Oe').gsub(/Ü/,'Ue').gsub(/ß/,'ss').gsub(/á/,'a').gsub(/Á/,'A')
    temp = temp.gsub(/ó/,'o').gsub(/Ó/,'O').gsub(/ú/,'u').gsub(/Ú/,'U').gsub(/à/,'a')
    temp = temp.gsub(/À/,'A').gsub(/ò/,'o').gsub(/Ò/,'O').gsub(/ù/,'u').gsub(/Ù/,'U')
  end
  def soundex
    prepare = self.makepureascii.downcase
    prepare = prepare.gsub(/[bfpv]+/){|m|m[0].chr}.gsub(/[cgjkqsxz]+/){|m|m[0].chr}
    prepare = prepare.gsub(/[dt]+/){|m|m[0].chr}.gsub(/[l]+/){|m|m[0].chr}
    prepare = prepare.gsub(/[mn]+/){|m|m[0].chr}.gsub(/[r]+/){|m|m[0].chr}
    res = prepare.slice(0).chr.upcase
    shortrest = prepare[1..-1].gsub(/[aehiouwy]/, '')
    shortrest = shortrest.gsub(/[bfpv]/, '1').gsub(/[cgjkqsxz]/, '2').gsub(/[dt]/, '3')
    res + shortrest.gsub(/[l]/, '4').gsub(/[mn]/, '5').gsub(/[r]/, '6').ljust(3, '0').slice(0..2)
  end
end

puts "Euler: #{'Euler'.soundex}"
puts "Ellery: #{'Ellery'.soundex}"
puts "Gauss: #{'Gauss'.soundex}"
puts "Ghosh: #{'Ghosh'.soundex}"
puts "Knuth: #{'Knuth'.soundex}"
puts "Kant: #{'Kant'.soundex}"
puts "Lloyd: #{'Lloyd'.soundex}"
puts "Ladd: #{'Ladd'.soundex}"
puts "Lukasiewicz: #{'Lukasiewicz'.soundex}"
puts "Lissajous: #{'Lissajous'.soundex}"
puts "Hilbert: #{'Hilbert'.soundex}"
puts "Nádasi: #{'Nádasi'.soundex}"
puts "Müller: #{'Müller'.soundex}"
puts "Möller: #{'Möller'.soundex}"
puts "Maier: #{'Maier'.soundex}"
puts "Meier: #{'Meier'.soundex}"
puts "Meyer: #{'Meyer'.soundex}"
puts "Rainer: #{'Rainer'.soundex}"
puts "Reiner: #{'Reiner'.soundex}"

Euler: E460
Ellery: E460
Gauss: G200
Ghosh: G200
Knuth: K530
Kant: K530
Lloyd: L300
Ladd: L300
Lukasiewicz: L222
Lissajous: L222
Hilbert: H416
Nádasi: N320
Müller: M460
Möller: M460
Maier: M600
Meier: M600
Meyer: M600
Rainer: R560
Reiner: R560

 callcc{|xx| callcc{|yy| lambda{|zz| zz}[yy]}[xx]}["Love Ruby but adore Scheme"]

 callcc{|xx| callcc{|yy| lambda{|zz| zz}[yy]}[xx]}["Love Ruby but adore Scheme"]

def levenshtein(s, t)
  n = s.length
  m = t.length
  d = Array.new(n+1) {|i| Array.new(m+1, 0)}
  for i in 0..n
    d[i][0] = i
  end
  for j in 0..m
    d[0][j] = j
  end
  for i in 1..n
    for j in 1..m
      if s[i-1] == t[j-1]
        cost = 1
      else
        cost = 0
      end
      d[i][j] = [d[i-1][ j ] + 1,   # insert
                 d[ i ][j-1] + 1,   # delete
                 d[i-1][j-1] + cost # substitute
                ].min
    end
  end

  d[n][m]
end

puts levenshtein('levenshtein', 'meilenstein')