English
Related papers

Related papers: Entailment Relations on Distributions

200 papers

The automatic ranking of word pairs as per their semantic relatedness and ability to mimic human notions of semantic relatedness has widespread applications. Measures that rely on raw data (distributional measures) and those that use…

Computation and Language · Computer Science 2012-03-09 Saif M Mohammad , Graeme Hirst

To combine and query ordered data from multiple sources, one needs to handle uncertainty about the possible orderings. Examples of such "order-incomplete" data include integrated event sequences such as log entries, lists of properties…

Databases · Computer Science 2018-01-30 Antoine Amarilli , Mouhamadou Lamine Ba , Daniel Deutch , Pierre Senellart

Starting with a likelihood or preference order on worlds, we extend it to a likelihood ordering on sets of worlds in a natural way, and examine the resulting logic. Lewis (1973) earlier considered such a notion of relative likelihood in the…

Artificial Intelligence · Computer Science 2014-07-29 Joseph Y. Halpern

Decisions are often based on imprecise, uncertain or vague information. Likewise, the consequences of an action are often equally unpredictable, thus putting the decision maker into a twofold jeopardy. Assuming that the effects of an action…

General Economics · Economics 2022-05-03 Stefan Rass , Sandra König , Stefan Schauer

Probabilistic word embeddings have shown effectiveness in capturing notions of generality and entailment, but there is very little work on doing the analogous type of investigation for sentences. In this paper we define probabilistic models…

Computation and Language · Computer Science 2020-05-19 Mingda Chen , Kevin Gimpel

We discuss the statistical properties of parton distributions within the framework of the NNPDF methodology. We present various tests of statistical consistency, in particular that the distribution of results does not depend on the…

Transformer language models encode the notion of word order using positional information. Most commonly, this positional information is represented by absolute position embeddings (APEs), that are learned from the pretraining data. However,…

Computation and Language · Computer Science 2022-10-25 Koustuv Sinha , Amirhossein Kazemnejad , Siva Reddy , Joelle Pineau , Dieuwke Hupkes , Adina Williams

We introduce a novel logical notion--partial entailment--to propositional logic. In contrast with classical entailment, that a formula P partially entails another formula Q with respect to a background formula set \Gamma intuitively means…

Logic in Computer Science · Computer Science 2014-01-17 Yi Zhou , Yan Zhang

Partial orders are used extensively for modeling and analyzing concurrent computations. In this paper, we define two properties of partially ordered sets: width-extensibility and interleaving-consistency, and show that a partial order can…

Distributed, Parallel, and Cluster Computing · Computer Science 2014-10-07 Himanshu Chauhan , Vijay K. Garg

Combining the representations of the words that make up a sentence into a cohesive whole is difficult, since it needs to account for the order of words, and to establish how the words present relate to each other. The solution we propose…

Computation and Language · Computer Science 2021-03-04 Diego Maupomé , Marie-Jean Meurs

In Probabilistic Logic Nilsson uses the device of a probability distribution over a set of possible worlds to assign probabilities to the sentences of a logical language. In his paper Nilsson concentrated on inference and associated…

Artificial Intelligence · Computer Science 2013-04-10 Fahiem Bacchus

This dissertation explores the linguistic and computational aspects of the meaning relations that can hold between two or more complex linguistic expressions (phrases, clauses, sentences, paragraphs). In particular, it focuses on…

Computation and Language · Computer Science 2022-08-11 Venelin Kovatchev

Beyond the local constraints imposed by grammar, words concatenated in long sequences carrying a complex message show statistical regularities that may reflect their linguistic role in the message. In this paper, we perform a systematic…

Statistical Mechanics · Physics 2007-05-23 Marcelo A. Montemurro , Damian H. Zanette

In the present paper a new concept of representability is introduced, which can be applied to not total and also to intransitive relations (semiorders in particular). This idea tries to represent the orderings in the simplest manner,…

General Topology · Mathematics 2024-01-25 Gianni Bosi , Asier Estevan , Magali Zuanon

Citation texts are sometimes not very informative or in some cases inaccurate by themselves; they need the appropriate context from the referenced paper to reflect its exact contributions. To address this problem, we propose an unsupervised…

Computation and Language · Computer Science 2017-05-24 Arman Cohan , Nazli Goharian

A novel partial order is defined on the space of digraphs or hypergraphs, based on assessing the cost of producing a graph via a sequence of elementary transformations. Leveraging work by Knuth and Skilling on the foundations of inference,…

Artificial Intelligence · Computer Science 2017-03-14 Ben Goertzel

We present a new framework for compositional distributional semantics in which the distributional contexts of lexemes are expressed in terms of anchored packed dependency trees. We show that these structures have the potential to capture…

Computation and Language · Computer Science 2016-08-26 David Weir , Julie Weeds , Jeremy Reffin , Thomas Kober

We provide an overview of the hybrid compositional distributional model of meaning, developed in Coecke et al. (arXiv:1003.4394v1 [cs.CL]), which is based on the categorical methods also applied to the analysis of information flow in…

Computation and Language · Computer Science 2011-06-08 Mehrnoosh Sadrzadeh , Edward Grefenstette

We examine the complexity of inference in Bayesian networks specified by logical languages. We consider representations that range from fragments of propositional logic to function-free first-order logic with equality; in doing so we cover…

Artificial Intelligence · Computer Science 2017-01-09 Fabio Gagliardi Cozman , Denis Deratani Mauá

The elements of a finite nonempty partially ordered set are exposed at independent uniform times in $[0,1]$ to a selector who, at any given time, can see the structure of the induced partial order on the exposed elements. The selector's…

Optimization and Control · Mathematics 2010-10-07 Ragnar Freij , Johan Wästlund