Affiliation:
1. University of Hawaii, Honolulu HI, USA
Abstract
"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.
Reference68 articles.
1. Kazimierz Ajdukiewicz. Die syntaktische konnexität. Studia Philosophica, 1:1-27, 1935. Translation in: Polish Logic 1920-1939 (S. McCall, ed), Oxford University Press 1967, pp 202-231.
2. Yehoshua Bar-Hillel. A quasi-arithmetical notation for syntactic description. Language, 29(1):47-58, 1953. doi:10.2307/410452.
3. Michael Barr. On categories with effective unions. In F. Bourceux, editor, Categorical algebra and its applications, volume 1348 of Lecture Notes in Mathematics, pages 19-35. Springer-Verlag, 1988. doi:10.1007/bfb0081346.
4. Garrett Birkhoff. Lattice Theory, volume 25 of American Mathematical Society Colloquium Publications. American Mathematical Society, 1940. doi:10.1090/coll/025.
5. Leonard Bloomfield. On some rules of Panini. Journal of the American Oriental Society, 47:61-70, 1927. URL: http://www.jstor.org/stable/593241.