//package hiougyf;

import java.util.*;;

public class Main {

	public static void main(String[] args) {
		// TODO Auto-generated method stub
		   //Reader sc=new Reader();
        Scanner sc =new Scanner(System.in);
     String s=sc.next();
      String t=sc.next();
      int n=s.length();
      int m=t.length();
      int min=Integer.MAX_VALUE;
     // if(n<m) System.out.println();
      for(int i=0;i<=(n-m);i++) {
    	  String c=s.substring(i,(i+m));
    	//  System.out.println(c);
    	  int h=find(c,t,m);
    	   min=Math.min(min, h);
      }
      System.out.println(min);
	}
      static int find(String s,String t,int n) {
    	  int ans=0;
    	  for(int i=0;i<n;i++) {
    		  if(s.charAt(i)!=t.charAt(i)) ans++;
    	  }
    	  return ans;
      }
    
         
  public static int gcd(int a, int b) 
    { 
        if (a == 0) 
            return b; 
          
        return gcd(b%a, a); 
    } 
   public static int lcm(int a, int b)  
  {  
     return (a*b)/gcd(a, b);  
	}

}

/tmp/hf-datasets-cache/medium/datasets/42704881117311-config-parquet-and-info-qiankunmu-Project_CodeNet-896c9d36/hub/datasets--qiankunmu--Project_CodeNet_Python800_and_Java250/snapshots/c899fde44a77ba1cc14973ed3de064e4ff3aadc7/Project_CodeNet_Java250.tar.gz