template <class T> int distanceLevenshtein(const T& s1,const T& s2)
{
    const int N1= s1.size();
    const int N2= s2.size();

    if(N1==0)
      return N2;

    if(N2==0)
      return N1;
    
    int cout;
    DynMatrix::Dyn2DMatrix<int> mat(N1+1,N2+1);

    for(int i=0;i<=N1;++i)
      mat(i,0)=i;

    for(int i=0;i<=N2;++i)
      mat(0,i)=i;

     for(int i=1;i<=N1;++i)
     {
       for(int j=1;j<=N2;++j)
       {
          cout= s1[i-1]==s2[j-1] ? 0 : 1;

           mat(i,j)=std::min(std::min(mat(i-1,j)+1,mat(i,j-1)+1),mat(i-1,j-1)+cout);
       }
     }

    return mat(N1,N2);
}