paper-with-me

홈 › Papers

Grammar Equations

2021-06-14 · ACL (SemSpace, IWCS) 2021 6 · Bob Coecke, Vincent Wang

Diagrammatically speaking, grammatical calculi such as pregroups provide wires between words in order to elucidate their interactions, and this enables one to verify grammatical correctness of phrases and sentences. In this paper we also provide wirings within words. This will enable us to identify grammatical constructs that we expect to be either equal or closely related. Hence, our work paves the way for a new theory of grammar, that provides novel `grammatical truths'. We give a nogo-theorem for the fact that our wirings for words make no sense for preordered monoids, the form which grammatical calculi usually take. Instead, they require diagrams -- or equivalently, (free) monoidal categories.

📄 PDF Abstract BibTeX arXiv:2106.07485

Code (0)

등록된 구현이 없습니다.

Similar Papers 제목 키워드 기반

Probabilistic Grammars for Equation Discovery

2020-12-01 · Jure Brence, Ljupčo Todorovski, Sašo Džeroski

Equation discovery, also known as symbolic regression, is a type of automated modeling that discovers scientific laws, expressed in the form of equations, from observed data and expert knowledge. Deterministic grammars, …

Equation DiscoverySymbolic Regression

Neuro-Symbolic ODE Discovery with Latent Grammar Flow

2026-04-17 · Karin Yu, Eleni Chatzi, Georgios Kissas arxiv

Understanding natural and engineered systems often relies on symbolic formulations, such as differential equations, which provide interpretability and transferability beyond black-box models. We introduce Latent Grammar …

Probabilistic Regular Tree Priors for Scientific Symbolic Reasoning

2023-06-14 · Tim Schneider, Amin Totounferoush, Wolfgang Nowak, Steffen Staab

Symbolic Regression (SR) allows for the discovery of scientific equations from data. To limit the large search space of possible equations, prior knowledge has been expressed in terms of formal grammars that characterize…

Bayesian InferenceregressionSymbolic Regression

Emergence of order in random languages

2019-02-20 · Eric De Giuli

We consider languages generated by weighted context-free grammars. It is shown that the behaviour of large texts is controlled by saddle-point equations for an appropriate generating function. We then consider ensembles …

Language ModelingLanguage Modellingvalid

A Reinforcement Learning Approach to Domain-Knowledge Inclusion Using Grammar Guided Symbolic Regression

2022-02-09 · Laure Crochepierre, Lydia Boudjeloud-Assala, Vincent Barbesant

In recent years, symbolic regression has been of wide interest to provide an interpretable symbolic representation of potentially large data relationships. Initially circled to genetic algorithms, symbolic regression met…

regressionreinforcement-learningReinforcement Learning (RL)Symbolic Regression