λ A packaging of tools for expressing dependency graphs as typed derivations of a categorial grammar.
-
Updated
Nov 24, 2023 - Python
λ A packaging of tools for expressing dependency graphs as typed derivations of a categorial grammar.
A neural parser for typelogical grammars based on Sinkhorn networks and Linear Logic Proof Nets.
Constructive categorial grammar supertagging with (pick any of: [heterogeneous | dynamic | attentive | structure-aware]) graph convolutions.
Add a description, image, and links to the type-logical-grammar topic page so that developers can more easily learn about it.
To associate your repository with the type-logical-grammar topic, visit your repo's landing page and select "manage topics."