!7

sclass MatchInput > DynPrintLogWithInput {
  start { dm_useLocallyCopiedMechLists(); }
  
  void update(S s) {
    print("\n> " + s);
    L<S> tokInput = printStruct(javaTokWithAngleBracketsC(s));
    new L<ParseResult1> results;
    
    // Try matching pattern & input word-by-word
    for (S pat : mech_englishSentencePatterns())
      ai_matchAngleBracketPattern_toParseResults(javaTokWithAngleBracketsC_addNumbers(pat), tokInput, results);
      
    // Try expanding patterns
    for (S pat : mech_englishSentencePatterns())
      ai_matchAngleBracketPattern_spread_toParseResults(javaTokWithAngleBracketsC_addNumbers(pat), tokInput, results);

    // Go through sorted results, try to solve assumptions using subsolve
    for (ParseResult1 p : parseResultsByNumberOfAssumptions(results)) {
      new L<PairS> verified;
      for (PairS assumption : p.assumptions) {
        S category = assumption.a, phrase = assumption.b;
        if (eq(category, "<noun>"))
          for (S pat : mL("Noun phrase patterns")) {
            LPairS match = ai_matchAngleBracketPattern(javaTokWithAngleBracketsC_addNumbers(pat), javaTokWithAngleBracketsC(phrase));
            if (match != null && empty(match)) {
              //print("Verified: " + assumption);
              verified.add(assumption);
            }
          }
      }
      addIfNotNull(results, parseResultWithVerifiedAssumptions(p, verified));
    }

    for (ParseResult1 p : takeFirst(10, parseResultsByNumberOfAssumptions(results)))
      print("  [" + l(p.assumptions) + "] " + joinNemptiesWithComma(ai_renderMatchWithQuestionMarks(p.assumptions), ai_renderMatch(p.matches)) + " | pattern " + quote(joinWithSpace(p.pat)) + " for input "  + quote(joinWithSpace(p.input)));
      
    if (l(results) > 10) print("[" + (l(results)-10) + " more]");
  }
}