论文标题
张量超过潜在的加权逻辑程序的半半度
Tensors over Semirings for Latent-Variable Weighted Logic Programs
论文作者
论文摘要
半解析是一个优雅的框架，用于使用半级加权逻辑程序来描述解析器。在本文中，我们介绍了此概念的概括：潜在可变性的半程解析。使用我们的框架，可以通过将权重从半级别的标量值转换为半级值的标量值，从而可以通过将权重转换为半度性值的标量值，从而允许半程解析框架内的潜在变量建模。在处理张量时，半度性的概念太强烈了，我们必须诉诸较弱的结构：部分半程。我们证明，这种概括保留了原始半度框架的所有期望属性，同时严格提高了其表现力。
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.
