ivdpol/QuantifierComplexity Fork of paulodder/QuantifierComplexity

Accompanies the paper "Quantifiers satisfying semantic universals have shorter minimal description length"; generates a large collection of quantifiers and computes their complexities, in order to explain semantic universals

Language: Python - Size: 68.9 MB - Last synced at: about 2 years ago - Pushed at: about 3 years ago - Stars: 0 - Forks: 1