Entailment Relations on Distributions
In this paper we give an overview of partial orders on the space of probability distributions that carry a notion of information content and serve as a generalisation of the Bayesian order given in (Coecke and Martin, 2011). We investigate what constraints are necessary in order to get a unique notion of information content. These partial orders can be used to give an ordering on words in vector space models of natural language meaning relating to the contexts in which words are used, which is useful for a notion of entailment and word disambiguation. The construction used also points towards a way to create orderings on the space of density operators which allow a more fine-grained study of entailment. The partial orders in this paper are directed complete and form domains in the sense of domain theory.
Code (0)
등록된 구현이 없습니다.
Similar Papers 제목 키워드 기반
Distributional Sentence Entailment Using Density Matrices
Categorical compositional distributional model of Coecke et al. (2010) suggests a way to combine grammatical composition of the formal, type logical models with the corpus based, empirical word representations of distrib…
Lexical EntailmentSentenceFrom the One, Judge of the Whole: Typed Entailment Graph Construction with Predicate Generation
Entailment Graphs (EGs) have been constructed based on extracted corpora as a strong and explainable form to indicate context-independent entailment relations in natural languages. However, EGs built by previous methods …
graph constructionA Vector Space for Distributional Semantics for Entailment
Distributional semantics creates vector-space representations that capture many forms of semantic similarity, but their relation to semantic entailment has been less clear. We propose a vector-space model which provides …
Lexical EntailmentSemantic SimilaritySemantic Textual SimilarityEntailment Graph Learning with Textual Entailment and Soft Transitivity
Typed entailment graphs try to learn the entailment relations between predicates from text and model them as edges between predicate nodes. The construction of entailment graphs usually suffers from severe sparsity and u…
Graph LearningNatural Language InferenceEntailment Graph Learning with Textual Entailment and Soft Transitivity
Typed entailment graphs try to learn the entailment relations between predicates from text and model them as edges between predicate nodes. The construction of entailment graphs usually suffers from severe sparsity and u…
Graph LearningNatural Language Inference