Lambek pregroups are Frobenius spiders in preorders
Fuente:
arXiv
Salvato in:
| Autore principale: | |
|---|---|
| Natura: | Preprint |
| Pubblicazione: |
2021
|
| Soggetti: | |
| Accesso online: | |
| Tags: |
Aggiungi Tag
Nessun Tag, puoi essere il primo ad aggiungerne!!
|
| _version_ | 1866916347176288256 |
|---|---|
| author | Pavlovic, Dusko |
| author_facet | Pavlovic, Dusko |
| contents | "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. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2105_03038 |
| institution | arXiv |
| publishDate | 2021 |
| record_format | arxiv |
| spellingShingle | Lambek pregroups are Frobenius spiders in preorders Pavlovic, Dusko Category Theory Computation and Language Formal Languages and Automata Theory Logic in Computer Science Logic 68Q42, 03B47, 68T50, 03B65, 18A15, 18B35, 18D10, 18B10, 03B70, 91F20 F.4.2; I.2.7; I.2.6 "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. |
| title | Lambek pregroups are Frobenius spiders in preorders |
| topic | Category Theory Computation and Language Formal Languages and Automata Theory Logic in Computer Science Logic 68Q42, 03B47, 68T50, 03B65, 18A15, 18B35, 18D10, 18B10, 03B70, 91F20 F.4.2; I.2.7; I.2.6 |
| url | https://arxiv.org/abs/2105.03038 |