The reviewed record of science sign in
Pith

arxiv: 2001.02296 · v2 · pith:QEMIWW3F · submitted 2020-01-02 · cs.FL · cs.AI· cs.LO

Incremental Monoidal Grammars

Dan Shiebler , Alexis Toumi , Mehrnoosh Sadrzadeh This is my paper

Reviewed by Pith T0 review T1 audit T2 compute T3 formal T4 kernel pith:QEMIWW3Frecord.jsonopen to challenge →

classification cs.FL cs.AIcs.LO
keywords grammarsformalautomatacategorylanguagemonoidalweightedallows
0
0 comments X
read the original 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.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.