Transforming text to logical representations using Universal Dependency, Generative Grammar, Lambda Calculus, and Neo-Davidsonian Semantics. This module contains hand-crafted Lambda structures for each dependency relation, which are then composed hierarchically with beta-reduction. The logical representation makes uses of Neo-Davidsonian semantics with thematic roles.
python -m src "Brutus stabs Caesar"The equivalent logical representation is
∃x.∃y. stabs(e, x, y) & Brutus(x) & Ceasar(y)
Or with quantificational event semantics + thematic roles (in development)
python -m src -q "John kissed every girl"which produces ∀x[girl(x) → ∃e[kissed(e) & Ag(e, John) & Th(e, x)]]