for (j = 0; j < 7; j++)
    {
        correctW[j].number = 0;
        for (i = 0; i < 4773; i++)
        {
            if (abz(correct[j].arr.length() - vocabWords[i].arr.length()) <= 2)
            {
                actions = levensteinLength(correct[j].arr, vocabWords[i].arr, 1, 1, 1);
                if (actions < minActions)
                {
                    minActions = actions;
                    correctW[j].arr = vocabWords[i].arr;
                    correctW[j].number = correct[j].number;
                }
                else if (actions == minActions && actions <= 2)
                {
                        if (vocabWords[i].number < correctW[j].number)
                        {
                            correctW[j].arr = vocabWords[i].arr;
                            correctW[j].number = correct[j].number;
                        }
                }
                if (j == 6 && actions == 4 && oxi == false)
                {
                    oxi = true;
                    correctW[j].arr = vocabWords[i].arr;
                }
            }
        }
        if (correct[j].arr.length() >= 2 + correctW[j].arr.length() && minActions != 3)
        {
            SpacePlace = whitespaceEdit(correct[j].arr, correctW[j].arr);
            correctW[j].arr = correct[j].arr;
            correctW[j].arr = correctW[j].arr.insert(SpacePlace, " ");
            minActions = levensteinLength(correct[j].arr, correctW[j].arr, 1, 1, 1);
        }
        if (minActions > 2)
            cout << correct[j].arr << " not found \n";
        else
            cout << correct[j].arr << " " << correctW[j].arr << " " << minActions << endl;
        minActions = 3;
    }