continue;
}
word = word.trim();
PasswordResults normal = new PasswordAnalysis(word);
finder.analyze(normal);
passwords[batchCount] = normal;
if (batchCount == batchSize - 1) {
for (PasswordResults password : passwords) {
finder.waitForAnalysis(password);
PathCost normCost = password.calculateHighestProbablePatterns();