English
Related papers

Related papers: Quantitative and Metric Rewriting: Abstract, Non-E…

200 papers

Evaluating large language models (LLMs) is fundamental, particularly in the context of practical applications. Conventional evaluation methods, typically designed primarily for LLM development, yield numerical scores that ignore the user…

Computation and Language · Computer Science 2024-04-12 Yongqiang Ma , Lizhi Qing , Jiawei Liu , Yangyang Kang , Yue Zhang , Wei Lu , Xiaozhong Liu , Qikai Cheng

General relativity can be recast as a theory of connections by performing a canonical transformation on its phase space. In this form, its (kinematical) structure is closely related to that of Yang-Mills theory and topological field…

High Energy Physics - Theory · Physics 2008-02-03 Abhay Ashtekar

Categorical compositional distributional semantics is a model of natural language; it combines the statistical vector space models of words with the compositional models of grammar. We formalise in this model the generalised quantifier…

Computation and Language · Computer Science 2019-11-12 Jules Hedges , Mehrnoosh Sadrzadeh

Canonical quantization may be approached from several different starting points. The usual approaches involve promotion of c-numbers to q-numbers, or path integral constructs, each of which generally succeeds only in Cartesian coordinates.…

Quantum Physics · Physics 2009-10-31 John R. Klauder

The mathematical notion of incompleteness (eg of rational numbers, Turing-computable functions, and arithmetic proof) does not play a key role in conventional physics. Here, a reformulation of the kinematics of quantum theory is attempted,…

Quantum Physics · Physics 2007-05-23 T. N. Palmer

Large Language Models (LLMs) have demonstrated impressive capabilities in creative tasks such as storytelling and E-mail generation. However, as LLMs are primarily trained on final text results rather than intermediate revisions, it might…

Computation and Language · Computer Science 2023-12-21 Lei Shu , Liangchen Luo , Jayakumar Hoskere , Yun Zhu , Yinxiao Liu , Simon Tong , Jindong Chen , Lei Meng

The goal of document-level relation extraction (RE) is to identify relations between entities that span multiple sentences. Recently, incomplete labeling in document-level RE has received increasing attention, and some studies have used…

Computation and Language · Computer Science 2024-01-26 Ye Wang , Huazheng Pan , Tao Zhang , Wen Wu , Wenxin Hu

Inspired by how humans summarize long documents, we propose an accurate and fast summarization model that first selects salient sentences and then rewrites them abstractively (i.e., compresses and paraphrases) to generate a concise overall…

Computation and Language · Computer Science 2018-05-29 Yen-Chun Chen , Mohit Bansal

To develop rigorous knowledge about ML models -- and the systems in which they are embedded -- we need reliable measurements. But reliable measurement is fundamentally challenging, and touches on issues of reproducibility, scalability,…

Machine Learning · Computer Science 2024-08-13 A. Feder Cooper

Large Language Models (LLMs) play powerful, black-box readers in the retrieve-then-read pipeline, making remarkable progress in knowledge-intensive tasks. This work introduces a new framework, Rewrite-Retrieve-Read instead of the previous…

Computation and Language · Computer Science 2023-10-24 Xinbei Ma , Yeyun Gong , Pengcheng He , Hai Zhao , Nan Duan

In a previous work ("Abstract Data Type Systems", TCS 173(2), 1997), the last two authors presented a combined language made of a (strongly normalizing) algebraic rewrite system and a typed lambda-calculus enriched by pattern-matching…

Logic in Computer Science · Computer Science 2013-09-17 Frédéric Blanqui , Jean-Pierre Jouannaud , Mitsuhiro Okada

In this paper we present two approaches to Lindenmayer systems: the rule-based (or generative) approach, which focuses on L-systems as Thue rewriting systems and a constraint-based (or model-theoretic) approach, in which rules are abandoned…

Computation and Language · Computer Science 2021-04-06 Diego Gabriel Krivochen

This thesis is devoted to the study of a calculus that describes the application of conditional rewriting rules and the obtained results at the same level of representation. We introduce the rewriting calculus, also called the rho-calculus,…

Symbolic Computation · Computer Science 2007-05-23 Horatiu Cirstea

This ongoing project aims to define and investigate, from the standpoint of category theory, order theory and universal algebra, the notions of higher-order many-sorted rewriting system and of higher-order many-sorted categorial algebra and…

Category Theory · Mathematics 2026-01-16 Juan Climent Vidal , Enric Cosme Llópez , Raúl Ruiz Mora

We provide a framework for compositional and iterative design and verification of systems with quantitative information, such as rewards, time or energy. It is based on disjunctive modal transition systems where we allow actions to bear…

Logic in Computer Science · Computer Science 2017-02-09 Uli Fahrenberg , Jan Křetínský , Axel Legay , Louis-Marie Traonouez

Rewriting Induction (RI) is a principle to prove that an equation over terms is an inductive theorem of a rewrite system, i.e., that any ground instance of the equation is a theorem of the rewrite system. RI has been adapted to several…

Logic in Computer Science · Computer Science 2026-02-17 Naoki Nishida , Kazushi Nishie , Misaki Kojima

Automatic n-gram based metrics such as ROUGE are widely used for evaluating generative tasks such as summarization. While these metrics are considered indicative (even if imperfect) of human evaluation for English, their suitability for…

Computation and Language · Computer Science 2025-07-14 Itai Mondshine , Tzuf Paz-Argaman , Reut Tsarfaty

Current abstractive summarization systems present important weaknesses which prevent their deployment in real-world applications, such as the omission of relevant information and the generation of factual inconsistencies (also known as…

Computation and Language · Computer Science 2022-11-08 Diogo Pernes , Afonso Mendes , André F. T. Martins

Evaluating Natural Language Generation (NLG) systems is a challenging task. Firstly, the metric should ensure that the generated hypothesis reflects the reference's semantics. Secondly, it should consider the grammatical quality of the…

Computation and Language · Computer Science 2022-03-18 Md Rashad Al Hasan Rony , Liubov Kovriguina , Debanjan Chaudhuri , Ricardo Usbeck , Jens Lehmann

Reward models (RMs) play a critical role in aligning language models through the process of reinforcement learning from human feedback. RMs are trained to predict a score reflecting human preference, which requires significant time and cost…

Computation and Language · Computer Science 2024-10-21 Zihuiwen Ye , Fraser Greenlee-Scott , Max Bartolo , Phil Blunsom , Jon Ander Campos , Matthias Gallé