arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 2105.03038math.CTcs.CLcs.FLcs.LOmath.LO
收藏

Lambek 预群是预序中的 Frobenius 蜘蛛

Lambek pregroups are Frobenius spiders in preorders

University of Hawaii(夏威夷大学)

Dusko Pavlovic

AI总结:

本文证明 Lambek 预群可刻画为预序关系范畴中的点化 Frobenius 蜘蛛,并将预序蜘蛛代数刻画为预群的并,从而连接句法、语义及机器学习中的基结构。

摘要:

“蜘蛛(Spider)”是特殊 Frobenius 代数的昵称,后者是数学、物理学和计算机科学中的一种基础结构。预群则是语言学中的基础结构。预群和蜘蛛已被共同用于自然语言处理:前者用于句法,后者用于语义。事实表明,预群本身可以被刻画为预序关系范畴中的点化蜘蛛,在该范畴中它们自然地从语法中产生。反过来,一般的预序蜘蛛代数也可以被刻画为预群的并。这推广了将关系蜘蛛代数刻画为群的不交并的结论。由这些结果形成的组合式框架,为理解和应用机器学习与数据分析中的基结构提出了新途径。

英文摘要:

"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.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑