other,11-1-P99-1038,ak the <term> available readings </term> of <term> sentences </term> displaying <term> quantifier scope
other,12-2-P99-1038,ak availability </term> based upon the <term> function-argument structure </term> of a <term> sentence </term> allows a
other,13-1-P99-1038,ak of <term> sentences </term> displaying <term> quantifier scope ambiguity </term> , in which <term> partial scopes </term>
other,16-2-P99-1038,ak function-argument structure </term> of a <term> sentence </term> allows a <term> deterministic , polynomial
other,19-1-P99-1038,ak quantifier scope ambiguity </term> , in which <term> partial scopes </term> may be expressed . We show that using
other,26-2-P99-1038,ak polynomial time test </term> for the <term> availability of a reading </term> , while solving the same problem
other,3-1-P99-1038,ak correctly segmented . We propose a <term> formal system </term> for representing the <term> available
other,41-2-P99-1038,ak problem within theories based on the <term> well-formedness </term> of <term> sentences </term> in the <term>
other,43-2-P99-1038,ak the <term> well-formedness </term> of <term> sentences </term> in the <term> meaning language </term>
other,46-2-P99-1038,ak </term> of <term> sentences </term> in the <term> meaning language </term> has been shown to be NP-hard . To
other,7-2-P99-1038,ak expressed . We show that using a theory of <term> scope availability </term> based upon the <term> function-argument
other,8-1-P99-1038,ak system </term> for representing the <term> available readings </term> of <term> sentences </term> displaying
tech,19-2-P99-1038,ak </term> of a <term> sentence </term> allows a <term> deterministic , polynomial time test </term> for the <term> availability of a reading
Sakrij podrobnosti