</term>
allows a
<term>
deterministic , polynomial
#30888We show that using a theory of scope availability based upon the function-argument structure of a sentence allows a deterministic, polynomial time test for the availability of a reading, while solving the same problem within theories based on the well-formedness of sentences in the meaning language has been shown to be NP-hard.
other,41-2-P99-1038,ak
problem within theories based on the
<term>
well-formedness
</term>
of
<term>
sentences
</term>
in the
<term>
#30913We show that using a theory of scope availability based upon the function-argument structure of a sentence allows a deterministic, polynomial time test for the availability of a reading, while solving the same problem within theories based on the well-formedness of sentences in the meaning language has been shown to be NP-hard.