private double Q(int i0, int i1, int j0, int j1, Lang lang) {
double cost = 0;
if (i1 < i0) {
for (int j = j0; j <= j1; j++) {
cost += T.elementAt(j).getInsertionCost();
}
return cost;
} else if (j1 < j0) {
for (int i = i0; i <= i1; i++) {
cost += S.elementAt(i).getDeletionCost();
}
return cost;
} else if (i1 == i0 && j1 == j0) {
cost = S.elementAt(i0).getSubstitutionCost(T.elementAt(j0), lang);
QArray[i0][i1][j0][j1] = cost;
return cost;
} else if (i1 == i0) {
double minSubstituteValue = 1.0;
int minPosJ = j0;
for (int j = j0; j <= j1; j++) {
double subsitituteValue = S.elementAt(i0).getSubstitutionCost(T.elementAt(j), lang);
if (minSubstituteValue > subsitituteValue) {
minSubstituteValue = subsitituteValue;
minPosJ = j;
}
}
for (int j = j0; j <= j1; j++) {
if (j == minPosJ) {
cost += minSubstituteValue;
} else {
cost += T.elementAt(j).getInsertionCost();
}
}
} else if (j1 == j0) {
double minSubstituteValue = 1.0;
int minPosI = i0;
for (int i = i0; i <= i1; i++) {
double subsitituteValue = S.elementAt(i).getSubstitutionCost(T.elementAt(j0), lang);
if (minSubstituteValue > subsitituteValue) {
minSubstituteValue = subsitituteValue;
minPosI = i;
}
}
for (int i = i0; i <= i1; i++) {
if (i == minPosI) {
cost += minSubstituteValue;
} else {
cost += S.elementAt(i).getDeletionCost();
}
}
} else {
if (QArray[i0][i1][j0][j1] < Double.MAX_VALUE) {
return QArray[i0][i1][j0][j1];
}
for (int i = i0; i < i1; i++) {
for (int j = j0; j < j1; j++) {
double c =
Math.min(
Q(i0, i, j0, j, lang) + Q(i + 1, i1, j + 1, j1, lang),
Q(i0, i, j + 1, j1, lang) + Q(i + 1, i1, j0, j, lang) + swapCost);
if (c < QArray[i0][i1][j0][j1]) {
QArray[i0][i1][j0][j1] = c;
}
}
}
return QArray[i0][i1][j0][j1];
}
QArray[i0][i1][j0][j1] = cost;
return cost;
}
