Incremental Monoidal Grammars
In this work we define formal grammars in terms of free monoidal categories, along with a functor from the category of formal grammars to the category of automata. Generalising from the Booleans to arbitrary semirings, we extend our construction to weighted formal grammars and weighted automata. This allows us to link the categorical viewpoint on natural language to the standard machine learning notion of probabilistic language model.
Code (0)
등록된 구현이 없습니다.
Tasks
BIG-bench Machine LearningLanguage ModelingLanguage ModellingSimilar Papers 제목 키워드 기반
Classical linear logic, cobordisms and categorical semantics of categorial grammars
We propose a categorial grammar based on classical multiplicative linear logic. This can be seen as an extension of abstract categorial grammars (ACG) and is at least as expressive. However, constituents of {\it linear…
Classical linear logic, cobordisms and categorial grammars
We propose a categorial grammar based on classical multiplicative linear logic. This can be seen as an extension of abstract categorial grammars (ACG) and is at least as expressive. However, constituents of {\it linear l…
Symbol Grounding via Chaining of Morphisms
A new model of symbol grounding is presented, in which the structures of natural language, logical semantics, perception and action are represented categorically, and symbol grounding is modeled via the composition of mo…
Common Sense ReasoningSymmetric Monoidal Categories with Attributes
When designing plans in engineering, it is often necessary to consider attributes associated to objects, e.g. the location of a robot. Our aim in this paper is to incorporate attributes into existing categorical formalis…
AttributeAutonomization of Monoidal Categories
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 relies on a construction which freely adds…