public Levenshtein(String word1, String word2) {
		m = new int[word1.length() + 1][word2.length() + 1];
		w1 = word1;
		w2 = word2;
		for (int i = 0; i <= w1.length(); i++) {
			m[i][0] = i;
		}
		for (int j = 1; j <= w2.length(); j++) {
			m[0][j] = j;
		}
		for (int i = 1; i <= word1.length(); i++) {
			for (int j = 1; j <= word2.length(); j++) {
				m[i][j] = min(i, j);
			}
		}
	}