18 citations · 50 across the 9 of their papers we have counts for
10 papers
The free compact closure of a symmetric monoidal category
Antonin Delpeuch
We construct a compact closed category out of any symmetric monoidal category by freely adding adjoints to its objects. The morphisms of the completion are defined as string diagra…
The Word Problem for Braided Monoidal Categories is Unknot-Hard
Antonin Delpeuch, Jamie Vicary
We show that the word problem for braided monoidal categories is at least as hard as the unknotting problem. As a corollary, so is the word problem for Gray categories. We conjectu…
Sheet diagrams for bimonoidal categories
Cole Comfort, Antonin Delpeuch, Jules Hedges
Bimonoidal categories (also known as rig categories) are categories with two monoidal structures, one of which distributes over the other. We formally define sheet diagrams, a grap…
The word problem for double categories
Antonin Delpeuch
We solve the word problem for free double categories without equations between generators by translating it to the word problem for 2-categories. This yields a quadratic algorithm…
A survey of OpenRefine reconciliation services
Antonin Delpeuch
We review the services implementing the OpenRefine reconciliation API, comparing their design to the state of the art in record linkage. Due to the design of the API, the matching…
A Complete Language for Faceted Dataflow Programs
Antonin Delpeuch
We present a complete categorical axiomatization of a wide class of dataflow programs. This gives a three-dimensional diagrammatic language for workflows, more expressive than the…
OpenTapioca: Lightweight Entity Linking for Wikidata
Antonin Delpeuch
We propose a simple Named Entity Linking system that can be trained from Wikidata only. This demonstrates the strengths and weaknesses of this data source for this task and provide…
Normalization for planar string diagrams and a quadratic equivalence algorithm
Antonin Delpeuch, Jamie Vicary
In the graphical calculus of planar string diagrams, equality is generated by exchange moves, which swap the heights of adjacent vertices. We show that left- and right-handed excha…
Autonomization of Monoidal Categories
Antonin Delpeuch
We show that contrary to common belief in the DisCoCat community, a monoidal category is all that is needed to define a categorical compositional model of natural language. This re…
Complexity of Grammar Induction for Quantum Types
Antonin Delpeuch
Most categorical models of meaning use a functor from the syntactic category to the semantic category. When semantic information is available, the problem of grammar induction can…