# Tensors over Semirings for Latent-Variable Weighted Logic Programs

arXiv: https://arxiv.org/abs/2006.04232 · HTML: https://mlsanity.com/paper/2006.04232/

## Key facts

- Cited by 1 papers in the map (data through 14 Oct 2026).
- First posted on arXiv 7 Jun 2020.

## Built on by (most cited first, 1 of 1)

- [Weighted Programming](https://mlsanity.com/paper/2202.07577/) (2022)

## Abstract (arXiv)

Semiring parsing is an elegant framework for describing parsers by using semiring weighted logic programs. In this paper we present a generalization of this concept: latent-variable semiring parsing. With our framework, any semiring weighted logic program can be latentified by transforming weights from scalar values of a semiring to rank-n arrays, or tensors, of semiring values, allowing the modelling of latent variables within the semiring parsing framework. Semiring is too strong a notion when dealing with tensors, and we have to resort to a weaker structure: a partial semiring. We prove that this generalization preserves all the desired properties of the original semiring framework while strictly increasing its expressiveness.