MOL 2019 Accepted Papers
Sentence Length
Presupposition Projection and Repair Strategies in Trivalent Semantics
Parsing Weighted Order-Preserving Hyperedge Replacement Grammars
The Convexity of Strictly k-Piecewise Stochastic Languages
Learning with Partially Ordered Representations
Quantifier-free least fixed point functions for phonology
Efficient learning of Output Tier-based Strictly 2-Local functions
Dependently-Typed Montague Semantics in the Proof Assistant Agda-flat
Sensing Tree Automata as a Model of Syntactic Dependencies
Some classes of sets of structures definable without quantifiers