int sentence_parse(Sentence sent, Parse_Options opts) {
int nl;
verbosity = opts->verbosity;
free_sentence_disjuncts(sent);
resources_reset_space(opts->resources);
if (resources_exhausted(opts->resources)) {
sent->num_valid_linkages = 0;
return 0;
}
expression_prune(sent);
print_time(opts, "Finished expression pruning");
prepare_to_parse(sent, opts);
init_fast_matcher(sent);
init_table(sent);
/* A parse set may have been already been built for this sentence,
if it was previously parsed. If so we free it up before building another. */
free_parse_set(sent);
init_x_table(sent);
for (nl = opts->min_null_count;
(nl<=opts->max_null_count) && (!resources_exhausted(opts->resources)); ++nl) {
sent->null_count = nl;
sent->num_linkages_found = parse(sent, sent->null_count, opts);
print_time(opts, "Counted parses");
post_process_linkages(sent, opts);
if (sent->num_valid_linkages > 0) break;
}
free_table(sent);
free_fast_matcher(sent);
print_time(opts, "Finished parse");
return sent->num_valid_linkages;
}
/** Misnamed, this has nothing to do with chart parsing */
static void chart_parse(Sentence sent, Parse_Options opts)
{
int nl;
fast_matcher_t * mchxt;
count_context_t * ctxt;
/* Build lists of disjuncts */
prepare_to_parse(sent, opts);
if (resources_exhausted(opts->resources)) return;
mchxt = alloc_fast_matcher(sent);
ctxt = alloc_count_context(sent->length);
print_time(opts, "Initialized fast matcher");
if (resources_exhausted(opts->resources))
{
free_count_context(ctxt);
free_fast_matcher(mchxt);
return;
}
/* A parse set may have been already been built for this sentence,
* if it was previously parsed. If so we free it up before
* building another. Huh ?? How could that happen? */
free_parse_info(sent->parse_info);
sent->parse_info = parse_info_new(sent->length);
nl = opts->min_null_count;
while (true)
{
Count_bin hist;
s64 total;
if (resources_exhausted(opts->resources)) break;
sent->null_count = nl;
hist = do_parse(sent, mchxt, ctxt, sent->null_count, opts);
total = hist_total(&hist);
if (opts->verbosity > 1)
{
prt_error("Info: Total count with %zu null links: %lld\n",
sent->null_count, total);
}
/* total is 64-bit, num_linkages_found is 32-bit. Clamp */
total = (total > INT_MAX) ? INT_MAX : total;
total = (total < 0) ? INT_MAX : total;
sent->num_linkages_found = (int) total;
print_time(opts, "Counted parses");
select_linkages(sent, mchxt, ctxt, opts);
compute_chosen_disjuncts(sent);
sane_morphism(sent, opts);
post_process_linkages(sent, opts);
if (sent->num_valid_linkages > 0) break;
/* If we are here, then no valid linkages were found.
* If there was a parse overflow, give up now. */
if (PARSE_NUM_OVERFLOW < total) break;
/* loop termination */
if (nl == opts->max_null_count) break;
/* If we are here, we are going round again. Free stuff. */
free_linkages(sent);
nl++;
}
sort_linkages(sent, opts);
free_count_context(ctxt);
free_fast_matcher(mchxt);
}