%0 Conference Proceedings %T Tensors over Semirings for Latent-Variable Weighted Logic Programs %A Balkir, Esma %A Gildea, Daniel %A Cohen, Shay B. %Y Bouma, Gosse %Y Matsumoto, Yuji %Y Oepen, Stephan %Y Sagae, Kenji %Y Seddah, Djamé %Y Sun, Weiwei %Y Søgaard, Anders %Y Tsarfaty, Reut %Y Zeman, Dan %S Proceedings of the 16th International Conference on Parsing Technologies and the IWPT 2020 Shared Task on Parsing into Enhanced Universal Dependencies %D 2020 %8 July %I Association for Computational Linguistics %C Online %F balkir-etal-2020-tensors %X 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-variable models 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. %R 10.18653/v1/2020.iwpt-1.8 %U https://aclanthology.org/2020.iwpt-1.8 %U https://doi.org/10.18653/v1/2020.iwpt-1.8 %P 73-90