Pith. sign in

REVIEW 1 cited by

Grammar Equations

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2106.07485 v1 pith:NEOI5M4R submitted 2021-06-14 cs.CL math.CT

classification cs.CLmath.CT
keywords grammaticalwordscalculigrammarwiringscategoriescloselyconstructs
verification ladder T0 review T1 audit T2 compute T3 formal

Signed reviews

No signed human review yet.

0 comments
read the original abstract

Diagrammatically speaking, grammatical calculi such as pregroups provide wires between words in order to elucidate their interactions, and this enables one to verify grammatical correctness of phrases and sentences. In this paper we also provide wirings within words. This will enable us to identify grammatical constructs that we expect to be either equal or closely related. Hence, our work paves the way for a new theory of grammar, that provides novel `grammatical truths'. We give a nogo-theorem for the fact that our wirings for words make no sense for preordered monoids, the form which grammatical calculi usually take. Instead, they require diagrams -- or equivalently, (free) monoidal categories.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. Efficient Generation of Parameterised Quantum Circuits from Large Texts

    quant-ph 2025-05 conditional novelty 7.0 of 10

    A tree-based pregroup representation lets a quantum NLP pipeline convert long documents, up to 6410 words, into trainable parameterised quantum circuits much more reliably than the previous CCG-based pipeline.

Pith tools