import java.util.*;

public class Main {
    public static void main(String[] args) {
        Scanner s = new Scanner(System.in);
        String S = s.next();
        String T = s.next();
        char[] SS = S.toCharArray();
        char[] TT = T.toCharArray();
        int count = T.length();

        for (int i = 0; i < T.length(); i++) {
            for (int j = i; j < S.length(); j++) {
                int n = i;
                if (TT[i] == SS[j]) {
                    for (int k = 0; k < T.length() - i; k++) {
                        if(j + k >= S.length()){
                            n = count;
                            break;
                        }
                        if (TT[i + k] != SS[j + k]) n++;
                    }
                    if (n < count) count = n;
                }
            }
        }

        System.out.println(count);
    }
}
/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