Assertion: certain quantifier | /r/CapableOf | satisfy three proposed universals
Facets:
value: commonly
type: TEMPORAL
Source sentences:
text: In a recent development, Steinert-Threlkeld and Szymanik (forthcoming) studies learnability with the technology of neural networks, testing whether certain quantifiers satisfying three commonly proposed universals—that simple determiner denotations are monotone, Isom, and Conserv, respectively—are easier to learn than quantifiers that do not have these properties.