| tech,19-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 . | #30891 We show that using a theory of scope availability based upon the function-argument structure of a sentence allows adeterministic , 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,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 . | #30888 We show that using a theory of scope availability based upon the function-argument structure of asentence 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,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 . | #30850 We propose aformal system for representing the available readings of sentences displaying quantifier scope ambiguity, in which partial scopes 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 . | #30860 We propose a formal system for representing the available readings of sentences displayingquantifier scope ambiguity, in which partial scopes 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 . | #30858 We propose a formal system for representing the available readings ofsentences displaying quantifier scope ambiguity, in which partial scopes 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 . | #30879 We show that using a theory ofscope 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,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 . | #30915 We 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 ofsentences in the meaning language 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 . | #30898 We show that using a theory of scope availability based upon the function-argument structure of a sentence allows a deterministic, polynomial time test for theavailability 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,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 . | #30918 We 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 themeaning language 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 . | #30913 We 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 thewell-formedness of sentences in the meaning language has been shown to be NP-hard. | |
| 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 . | #30855 We propose a formal system for representing theavailable readings of sentences displaying quantifier scope ambiguity, in which partial scopes may be expressed. | |
| 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 . | #30884 We show that using a theory of scope availability based upon thefunction-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,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 . | #30866 We propose a formal system for representing the available readings of sentences displaying quantifier scope ambiguity, in whichpartial scopes may be expressed. |
