English
Related papers

Related papers: An Analysis of Decision Problems for Relational Pa…

200 papers

Transductions are binary relations of finite words. For rational transductions, i.e., transductions defined by finite transducers, the inclusion, equivalence and sequential uniformisation problems are known to be undecidable. In this paper,…

Formal Languages and Automata Theory · Computer Science 2016-03-01 Emmanuel Filiot , Ismaël Jecker , Christof Löding , Sarah Winter

The complex organization of syntax in hierarchical structures is one of the core design features of human language. Duality of patterning refers for instance to the organization of the meaningful elements in a language at two distinct…

Physics and Society · Physics 2016-02-12 Vittorio Loreto , Pietro Gravino , Vito D. P. Servedio , Francesca Tria

Motivated by questions from program transformations, eight notions of isomorphisms between term rewriting systems are defined, analysed, and classified. The notions include global isomorphisms, where the renaming of variables and function…

Logic in Computer Science · Computer Science 2022-12-01 Michael Christian Fink Amores , David Sabel

Individuals signal aspects of their identity and beliefs through linguistic choices. Studying these choices in aggregate allows us to examine large-scale attitude shifts within a population. Here, we develop computational methods to study…

Computation and Language · Computer Science 2021-09-24 Sky CH-Wang , David Jurgens

Linguistic relations in oral conversations present how opinions are constructed and developed in a restricted time. The relations bond ideas, arguments, thoughts, and feelings, re-shape them during a speech, and finally build knowledge out…

Computation and Language · Computer Science 2017-03-02 Ceyda Sanli , Anupam Mondal , Erik Cambria

The paper presents a language model that develops syntactic structure and uses it to extract meaningful information from the word history, thus enabling the use of long distance dependencies. The model assigns probability to every joint…

Computation and Language · Computer Science 2007-05-23 Ciprian Chelba , Frederick Jelinek

Current common interactions with language models is through full inference. This approach may not necessarily align with the model's internal knowledge. Studies show discrepancies between prompts and internal representations. Most focus on…

Computation and Language · Computer Science 2024-09-24 Jinman Zhao , Xueyan Zhang , Xingyu Yue , Weizhe Chen , Zifan Qian , Ruiyu Wang

This paper presents a new model for word sense disambiguation formulated in terms of evolutionary game theory, where each word to be disambiguated is represented as a node on a graph whose edges represent word relations and senses are…

Artificial Intelligence · Computer Science 2017-04-07 Rocco Tripodi , Marcello Pelillo

Natural languages are complexly structured entities. They exhibit characterising regularities that can be exploited to link them one another. In this work, I compare two morphological aspects of languages: Written Patterns and Sentence…

Computation and Language · Computer Science 2019-07-09 Alberto Calderone

Many formalisms combining ontology languages with uncertainty, usually in the form of probabilities, have been studied over the years. Most of these formalisms, however, assume that the probabilistic structure of the knowledge remains…

Artificial Intelligence · Computer Science 2015-06-29 İsmail İlkan Ceylan , Rafael Peñaloza

Grammar refers to the system of rules that governs the structural organization and the semantic relations among linguistic units such as sentences, phrases, and words within a given language. In natural language processing, there remains a…

Computation and Language · Computer Science 2026-02-24 Lujun Li , Yewei Song , Lama Sleem , Yiqun Wang , Yangjie Xu , Cedric Lothritz , Niccolo Gentile , Radu State , Tegawende F. Bissyande , Jacques Klein

Deverbal nouns are nominal forms of verbs commonly used in written English texts to describe events or actions, as well as their arguments. However, many NLP systems, and in particular pattern-based ones, neglect to handle such nominalized…

Computation and Language · Computer Science 2023-06-27 Aviv Weinstein , Yoav Goldberg

This paper proposes an extension to classical regular expressions by the addition of two operators allowing the inclusion of boolean formulae from the zeroth order logic. These expressions are called constrained expressions. The associated…

Formal Languages and Automata Theory · Computer Science 2015-10-09 Jean-Marc Champarnaud , Ludovic Mignot , Florent Nicart

Traditional language models treat language as a finite state automaton on a probability space over words. This is a very strong assumption when modeling something inherently complex such as language. In this paper, we challenge this by…

Computation and Language · Computer Science 2016-04-04 Kushal Arora , Anand Rangarajan

Language similarities can be caused by genetic relatedness, areal contact, universality, or chance. Colexification, i.e. a type of similarity where a single lexical form is used to convey multiple meanings, is underexplored. In our work, we…

Computation and Language · Computer Science 2024-01-08 Yiyi Chen , Johannes Bjerva

We continue the research on the generative capacity of contextual grammars where contexts are adjoined around whole words (externally) or around subwords (internally) which belong to special regular selection languages. All languages…

Formal Languages and Automata Theory · Computer Science 2022-09-01 Jürgen Dassow , Bianca Truthe

We consider probabilistic automata on infinite words with acceptance defined by parity conditions. We consider three qualitative decision problems: (i) the positive decision problem asks whether there is a word that is accepted with…

Formal Languages and Automata Theory · Computer Science 2011-07-12 Krishnendu Chatterjee , Mathieu Tracol

Distributed representations of words have been shown to capture lexical semantics, as demonstrated by their effectiveness in word similarity and analogical relation tasks. But, these tasks only evaluate lexical semantics indirectly. In this…

Computation and Language · Computer Science 2016-12-02 Thanapon Noraset , Chen Liang , Larry Birnbaum , Doug Downey

We introduce a method to measure uncertainty in large language models. For tasks like question answering, it is essential to know when we can trust the natural language outputs of foundation models. We show that measuring uncertainty in…

Computation and Language · Computer Science 2023-04-18 Lorenz Kuhn , Yarin Gal , Sebastian Farquhar

While large language models (LLMs) are generally considered proficient in generating language, how similar their language usage is to that of humans remains understudied. In this paper, we test whether models exhibit linguistic convergence,…

Computation and Language · Computer Science 2026-02-13 Terra Blevins , Susanne Schmalwieser , Benjamin Roth
‹ Prev 1 8 9 10 Next ›