ivdpol's repositories
quantifier-LZ-complexity
Accompanies the paper "Complexity and learnability in the explanation of semantic universals of quantifiers"; makes binary representations of quantifiers and computes their Lempel-Ziv complexities.
lahman-baseball-database
Analysis of baseball statistics from 1871 to 2022. Data from the open source Lahman baseball database. This project uses PostgreSQL, Python and Jupyter notebook.
Language:Jupyter Notebook000
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:PythonNOASSERTION000
tcg
Modeling the tacit communication game
Language:PythonMIT000