Incremental Monoidal Grammars [article]

Dan Shiebler, Alexis Toumi, Mehrnoosh Sadrzadeh
<span title="2020-01-10">2020</span> <i > arXiv </i> &nbsp; <span class="release-stage" >pre-print</span>
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.
<span class="external-identifiers"> <a target="_blank" rel="external noopener" href="https://arxiv.org/abs/2001.02296v2">arXiv:2001.02296v2</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/6i2w3xlizractausumhfjjwkqi">fatcat:6i2w3xlizractausumhfjjwkqi</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20200321025306/https://arxiv.org/pdf/2001.02296v2.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] </button> </a> <a target="_blank" rel="external noopener" href="https://arxiv.org/abs/2001.02296v2" title="arxiv.org access"> <button class="ui compact blue labeled icon button serp-button"> <i class="file alternate outline icon"></i> arxiv.org </button> </a>