Lambek pregroups are Frobenius spiders in preorders

@article{Pavlovic2022LambekPA,
  title={Lambek pregroups are Frobenius spiders in preorders},
  author={Dusko Pavlovic},
  journal={Compositionality},
  year={2022},
  volume={4},
  pages={1}
}
"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… 

Grammar equations

This work gives a nogo-theorem for the fact that wirings for words make no sense for preordered monoids, the form which grammatical calculi usually take, and paves the way for a new theory of grammar that provides novel ‘grammatical truths’.

References

SHOWING 1-10 OF 81 REFERENCES

Quantum and classical structures in nondeterministic computation

  • Proceedings of Quantum Interaction 2009,
  • 2009

A new description of orthogonal bases

We show that an orthogonal basis for a finite-dimensional Hilbert space can be equivalently characterised as a commutative †-Frobenius monoid in the category FdHilb, which has finite-dimensional

Geometry of abstraction in quantum computation

  • Dusko Pavlovic
  • Computer Science
    Classical and Quantum Information Assurance Foundations and Practice
  • 2009
The paper reconstructs Simon's algorithm, which is a sim­ ple predecessor of Shor's quantum algorithms for factoring and discrete loga­ rithms, and analyzes function abstraction in quantum computation, which turns out to characterize its clas­ sical interfaces.

QNLP in Practice: Running Compositional Models of Meaning on a Quantum Computer

Results on the first NLP experiments conducted on Noisy Intermediate-Scale Quantum (NISQ) computers for datasets of size ≥ 100 sentences are presented.

Functorial semantics for partial theories

A Lawvere-style definition for partial theories, extending the classical notion of equational theory by allowing partially defined operations, and demonstrating the expressivity of such equational theories by considering a number of examples.

Language Models are Few-Shot Learners

GPT-3 achieves strong performance on many NLP datasets, including translation, question-answering, and cloze tasks, as well as several tasks that require on-the-fly reasoning or domain adaptation, such as unscrambling words, using a novel word in a sentence, or performing 3-digit arithmetic.

A Frobenius Algebraic Analysis for Parasitic Gaps

This work identifies two types of parasitic gapping where the duplication of semantic content can be confined to the lexicon and proposes a polymorphic type schema for the head of the adjunct phrase that introduces the primary gap.

Quantum Natural Language Processing on Near-Term Quantum Computers

This work presents a method for mapping DisCoCat diagrams to quantum circuits, compatible both with NISQ devices and with established Quantum Machine Learning techniques, paving the way to near-term applications of quantum technology to natural language processing.

The nucleus of an adjunction and the Street monad on monads

It is shown that every adjunction can be resolved into a nuclear adjunction, and that the resulting Street monad on monads is strictly idempotent, and extracts the nucleus of a monad.

Editors

  • H. Fujikake
  • Biology, Geology
    Issues in Environmental Science and Technology
  • 2019
See pdf for details
...