!7 sclass MatchInput > DynPrintLogWithInput { start { dm_useLocallyCopiedMechLists(); } void update(S s) { print("\n> " + s); L tokInput = printStruct(javaTokWithAngleBracketsC(s)); PlanInMotion plan = new(mech_englishSentencePatterns()); L>> results = new L; // pattern + match // Try matching pattern & input word-by-word for (S pat : plan.master()) ai_matchAngleBracketPattern_toResults(pat, tokInput, results); // Try expanding patterns for (S pat : mech_englishSentencePatterns()) { LS tokPat = javaTokWithAngleBracketsC(pat); for (LS spreadInput : ai_spreadAllAngleVars(tokPat, tokInput)) ai_matchAngleBracketPattern_toResults(pat, spreadInput, results); } // Go through sorted results, try to solve assumptions for (Pair> p : sortedByLengthOfPairBList(results)) { new L verified; for (PairS assumption : p.b) { S category = assumption.a, phrase = assumption.b; if (eq(category, "")) for (S pat : mL("Noun phrase patterns")) { LPairS match = ai_matchAngleBracketPattern(javaTokWithAngleBracketsC(pat), javaTokWithAngleBracketsC(phrase)); if (match != null && empty(match)) { print("Verified: " + assumption); verified.add(assumption); } } } if (nempty(verified)) addPair(results, p.a, listMinusList(p.b, verified)); } for (Pair> p : sortedByLengthOfPairBList(results)) print(" [" + l(p.b) + "] " + ai_renderMatchWithQuestionMarks(p.b) + " | pattern " + quote(p.a) + " for input " + quote(s)); } }