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