English
Related papers

Related papers: On Generalization of Definitional Equivalence to L…

200 papers

Synonymy and translational equivalence are the relations of sameness of meaning within and across languages. As the principal relations in wordnets and multi-wordnets, they are vital to computational lexical semantics, yet the field suffers…

Computation and Language · Computer Science 2020-12-15 Bradley Hauer , Grzegorz Kondrak

The minimal deterministic finite automaton is generally used to determine regular languages equality. Antimirov and Mosses proposed a rewrite system for deciding regular expressions equivalence of which Almeida et al. presented an improved…

Formal Languages and Automata Theory · Computer Science 2009-07-30 Marco Almeida , Nelma Moreira , Rogério Reis

We characterize Morita equivalence of theories in the sense of Johnstone in terms of a new syntactic notion of a common definitional extension developed by Barrett and Halvorson for cartesian, regular, coherent, geometric and first-order…

Logic · Mathematics 2015-07-10 Dimitris Tsementzis

This paper aims to provide an analysis of what it means when we say that a pair of theories, very generously construed, are equivalent in the sense that they are interdefinable. With regard to theories articulated in first order logic, we…

Logic · Mathematics 2025-11-05 Toby Meadows

Patterns are words with terminals and variables. The language of a pattern is the set of words obtained by uniformly substituting all variables with words that contain only terminals. Regular constraints restrict valid substitutions of…

Formal Languages and Automata Theory · Computer Science 2024-11-13 Dirk Nowotka , Max Wiedenhöft

The main question here is the possible generalization of the following theorem on ``simple'' equivalence relation on 2^omega to higher cardinals. Theorem: (1) Assume that: (a) E is a Borel 2-place relation on 2^omega, (b) E is an…

Logic · Mathematics 2007-05-23 Saharon Shelah

We present a general relational semantics framework which, by varying the axiomatization and components of the relational structures, provides a uniform semantics for sentential logics, classical and non-classical alike. The approach we…

Logic in Computer Science · Computer Science 2025-11-25 Chrysafis Hartonas

Lemmatization of standard languages is concerned with (i) abstracting over morphological differences and (ii) resolving token-lemma ambiguities of inflected words in order to map them to a dictionary headword. In the present paper we aim to…

Computation and Language · Computer Science 2019-03-19 Enrique Manjavacas , Ákos Kádár , Mike Kestemont

These pure languages understanding directly relates to translation knowledge where linguists and translators need to work and research to eradicate misunderstanding. Misunderstandings mostly appear in non-equivalent words because there are…

Computation and Language · Computer Science 2025-08-22 Mohammad Ibrahim Qani

Using a vocabulary that is shared across languages is common practice in Multilingual Neural Machine Translation (MNMT). In addition to its simple design, shared tokens play an important role in positive knowledge transfer, assuming that…

Computation and Language · Computer Science 2024-01-23 Di Wu , Christof Monz

Identifying semantically equivalent sentences is important for many cross-lingual and mono-lingual NLP tasks. Current approaches to semantic equivalence take a loose, sentence-level approach to "equivalence," despite previous evidence that…

Computation and Language · Computer Science 2022-10-07 Shira Wein , Zhuxin Wang , Nathan Schneider

The thesis describes a logical formalization of natural-language database interfacing. We assume the existence of a ``natural language engine'' capable of mediating between surface linguistic string and their representations as ``literal''…

cmp-lg · Computer Science 2008-02-03 Manny Rayner

In this communication, we address the problem of approximating the atoms of a parametric dictionary, commonly encountered in the context of sparse representations in "continuous" dictionaries. We focus on the case of translation-invariant…

Information Theory · Computer Science 2020-12-01 Frédéric Champagnat , Cédric Herzet

A semantic equivalence assessment is defined as a task that assesses semantic equivalence in a sentence pair by binary judgment (i.e., paraphrase identification) or grading (i.e., semantic textual similarity measurement). It constitutes a…

Computation and Language · Computer Science 2022-10-24 Yuki Arase , Junichi Tsujii

Euphemisms substitute socially sensitive expressions, often softening or reframing meaning, and their reliance on cultural and pragmatic context complicates modeling across languages. In this study, we investigate how cross-lingual…

Computation and Language · Computer Science 2026-02-20 Hasan Can Biyik , Libby Barak , Jing Peng , Anna Feldman

Antonym vs synonym distinction across multiple languages presents unique computational challenges due to the paradoxical nature of antonymous relationships words that share semantic domains while expressing opposite meanings. This work…

Computation and Language · Computer Science 2025-10-28 Samyak S. Sanghvi

Knowledge transfer, especially across related languages, has been found beneficial for multilingual neural machine translation (MNMT), but some aspects are still under-explored and deserve further investigation. A joint vocabulary is most…

Computation and Language · Computer Science 2026-05-07 Oona Itkonen , Jörg Tiedemann

Given a non-cyclic simple dimension group D and a subgroup E of Q/Z, we produce a minimal \'etale equivalence relation R such that H_0(\R) is isomorphic to D \oplus E, where H_0(R) denotes the zeroth homology group of R. The equivalence…

Dynamical Systems · Mathematics 2025-04-28 Michael Francesco Ala , Hung-Chang Liao , Aaron Tikuisis

For vision-and-language reasoning tasks, both fully connectionist, end-to-end methods and hybrid, neuro-symbolic methods have achieved high in-distribution performance. In which out-of-distribution settings does each paradigm excel? We…

Computation and Language · Computer Science 2022-10-28 Wang Zhu , Jesse Thomason , Robin Jia

Terms of Church's $\lambda$-calculus can be considered equivalent along many different definitions, but context equivalence is certainly the most direct and universally accepted one. If the underlying calculus becomes probabilistic,…

Logic in Computer Science · Computer Science 2015-05-15 Raphaëlle Crubillé , Ugo Dal Lago
‹ Prev 1 2 3 10 Next ›