Incremental Monoidal Grammars
arXiv:2001.02296
Abstract
In this work we define formal grammars in terms of free monoidal categories, along with a functor from the category of formal grammars to the category of automata. Generalising from the Booleans to arbitrary semirings, we extend our construction to weighted formal grammars and weighted automata. This allows us to link the categorical viewpoint on natural language to the standard machine learning notion of probabilistic language model.
References in corpus (5)
- Experimental Support for a Categorical Compositional Distributional Model of Meaning
- Generalizing determinization from automata to coalgebras
- Lambek vs. Lambek: Functorial Vector Space Semantics and String Diagrams for Lambek Calculus
- Exploring Semantic Incrementality with Dynamic Syntax and Vector Space Semantics
- Thue's 1914 paper: a translation