6 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…
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…