mlsanityData to 7 Oct 2026

Lambek pregroups are Frobenius spiders in preorders

arXiv 2105.03038 ↗First posted 7 May 2021math.CT cs.CL cs.FLcited by 1

Not on the map. Why?

Abstract (arXiv)

"Spider" is a nickname of special Frobenius algebras, a fundamental structure from mathematics, physics, and computer science. Pregroups are a fundamental structure from linguistics. Pregroups and spiders have been used together in natural language processing: one for syntax, the other for semantics. It turns out that pregroups themselves can be characterized as pointed spiders in the category of preordered relations, where they naturally arise from grammars. The other way around, preordered spider algebras in general can be characterized as unions of pregroups. This extends the characterization of relational spider algebras as disjoint unions of groups. The compositional framework that emerged with the results suggests new ways to understand and apply the basis structures in machine learning and data analysis.

Key facts. Cited by 1 paper in the map (data through 7 Oct 2026). Builds on 13 of its 73 references that are in the map. First posted on arXiv 7 May 2021.

Builds on

13 of 73 references.

References · 13

  1. 2020Language Models are Few-Shot Learnerscited by 32,199
  2. 2021QNLP in Practice: Running Compositional Models of Meaning on a Quantum Computercited by 65
  3. 2020Quantum Natural Language Processing on Near-Term Quantum Computerscited by 39
  4. 2014The Frobenius anatomy of word meanings I: subject and object relative pronounscited by 24
  5. 2013Lambek vs. Lambek: Functorial Vector Space Semantics and String Diagrams for Lambek Calculuscited by 13
  6. 2014The Frobenius anatomy of word meanings II: possessive relative pronounscited by 12
  7. 2018Translating and Evolving: Towards a Model of Language Change in DisCoCatcited by 4
  8. 2019Compositionality for Recursive Neural Networkscited by 4
  9. 2020A Frobenius Algebraic Analysis for Parasitic Gapscited by 3
  10. 2017Monoidal computer III: A coalgebraic view of computability and complexitycited by 2
  11. 2013Bicompletions of distance matricescited by 1
  12. 2015Towards concept analysis in categories: limit inferior as algebra, limit superior as coalgebracited by 1
1 more
  1. 2020Functorial Semantics for Partial Theoriescited by 1

Built on by

Cited by year

Citing papers per year: 2021: 1.

1 paper.

  1. 2021Grammar Equationscited by 7