@[reducible, inline]
Domain size (simplified from 432 to 10)
Equations
Instances For
@[reducible, inline]
Intersection set sizes (simplified from 0-432 to 0-10)
Equations
Instances For
Equations
Instances For
@[reducible, inline]
Instances For
Instances For
@[reducible, inline]
Instances For
Threshold for each quantity word (from unified entry)
Equations
Instances For
GQT meaning: binary truth based on threshold
Equations
Instances For
GQT meaning as rational
Equations
Instances For
Prototype (peak truth) for each quantity word (from unified entry)
Equations
Instances For
Spread parameter (from unified entry)
Instances For
PT meaning: gradient truth based on distance from prototype
Equations
Instances For
Salience prior (uniform for simplicity)
Equations
- RSA.VanTielEtAl2021.salience Fragments.English.Determiners.QuantityWord.none_ = 1
- RSA.VanTielEtAl2021.salience Fragments.English.Determiners.QuantityWord.few = 1
- RSA.VanTielEtAl2021.salience Fragments.English.Determiners.QuantityWord.some_ = 1
- RSA.VanTielEtAl2021.salience Fragments.English.Determiners.QuantityWord.half = 1
- RSA.VanTielEtAl2021.salience Fragments.English.Determiners.QuantityWord.most = 1
- RSA.VanTielEtAl2021.salience Fragments.English.Determiners.QuantityWord.all = 1
Instances For
"some" threshold matches Montague's existential: count >= 1
"all" threshold matches Montague's universal: count = total
"most" threshold > half matches Montague's most_sem
"some" and "few" have opposite monotonicity (no entailment)