Correcting Knowledge Base Assertions

• URL: http://arxiv.org/abs/2001.06917v1
• Date: Sun, 19 Jan 2020 23:03:47 GMT
• Title: Correcting Knowledge Base Assertions
• Authors: Jiaoyan Chen, Xi Chen, Ian Horrocks, Ernesto Jimenez-Ruiz, and Erik B. Myklebus
• Abstract summary: The usefulness and usability of knowledge bases (KBs) is often limited by quality issues. One common issue is the presence of erroneous assertions, often caused by lexical or semantic confusion. We study the problem of correcting such assertions, and present a general correction framework which combines lexical matching, semantic embedding, soft constraint mining and semantic consistency checking.
• Score: 26.420502742339053
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: The usefulness and usability of knowledge bases (KBs) is often limited by quality issues. One common issue is the presence of erroneous assertions, often caused by lexical or semantic confusion. We study the problem of correcting such assertions, and present a general correction framework which combines lexical matching, semantic embedding, soft constraint mining and semantic consistency checking. The framework is evaluated using DBpedia and an enterprise medical KB.

Related papers

• Disjointness Violations in Wikidata [0.0]
  We analyze the current modeling of disjointness on Wikidata. We use SPARQL queries to identify each culprit'' causing a disjointness violation and lay out formulas to identify and fix conflicting information.
  arXiv  Detail & Related papers  (2024-10-17T16:07:51Z)
• ConstraintChecker: A Plugin for Large Language Models to Reason on Commonsense Knowledge Bases [53.29427395419317]
  Reasoning over Commonsense Knowledge Bases (CSKB) has been explored as a way to acquire new commonsense knowledge. We propose **ConstraintChecker**, a plugin over prompting techniques to provide and check explicit constraints.
  arXiv  Detail & Related papers  (2024-01-25T08:03:38Z)
• Exploiting Uncertainty for Querying Inconsistent Description Logics Knowledge Bases [0.3277163122167433]
  We exploit an existing probabilistic semantics called DISPONTE to overcome this problem. We implement our approach in the reasoners TRILL and BUNDLE and empirically tested the validity of our proposal.
  arXiv  Detail & Related papers  (2023-06-15T13:50:46Z)
• Injecting knowledge into language generation: a case study in auto-charting after-visit care instructions from medical dialogue [3.1542695050861544]
  This paper focuses on rare tokens that appear in both the source and the reference sequences. For high-stake domains that are also knowledge-rich, we show how to use knowledge to identify which rare tokens are important. We present a study in a knowledge-rich domain of healthcare, where we tackle the problem of generating after-visit care instructions.
  arXiv  Detail & Related papers  (2023-06-06T13:13:27Z)
• Zero-shot Faithful Factual Error Correction [53.121642212060536]
  Faithfully correcting factual errors is critical for maintaining the integrity of textual knowledge bases and preventing hallucinations in sequence-to-sequence models. We present a zero-shot framework that formulates questions about input claims, looks for correct answers in the given evidence, and assesses the faithfulness of each correction based on its consistency with the evidence.
  arXiv  Detail & Related papers  (2023-05-13T18:55:20Z)
• Towards preserving word order importance through Forced Invalidation [80.33036864442182]
  We show that pre-trained language models are insensitive to word order. We propose Forced Invalidation to help preserve the importance of word order. Our experiments demonstrate that Forced Invalidation significantly improves the sensitivity of the models to word order.
  arXiv  Detail & Related papers  (2023-04-11T13:42:10Z)
• An Efficient Diagnosis Algorithm for Inconsistent Constraint Sets [68.8204255655161]
  We introduce a divide-and-conquer based diagnosis algorithm (FastDiag) which identifies minimal sets of faulty constraints in an over-constrained problem. We compare FastDiag with the conflict-directed calculation of hitting sets and present an in-depth performance analysis.
  arXiv  Detail & Related papers  (2021-02-17T19:55:42Z)
• Revisiting the Prepositional-Phrase Attachment Problem Using Explicit Commonsense Knowledge [1.0312968200748118]
  We argue that explicit commonsense knowledge bases can provide an essential ingredient for making good attachment decisions. Our results suggest that the commonsense knowledge-based approach can provide the best of both worlds, integrating rule-based and statistical techniques.
  arXiv  Detail & Related papers  (2021-02-01T15:48:36Z)
• Probably Approximately Correct Constrained Learning [135.48447120228658]
  We develop a generalization theory based on the probably approximately correct (PAC) learning framework. We show that imposing a learner does not make a learning problem harder in the sense that any PAC learnable class is also a constrained learner. We analyze the properties of this solution and use it to illustrate how constrained learning can address problems in fair and robust classification.
  arXiv  Detail & Related papers  (2020-06-09T19:59:29Z)
• Faithful Embeddings for Knowledge Base Queries [97.5904298152163]
  deductive closure of an ideal knowledge base (KB) contains exactly the logical queries that the KB can answer. In practice KBs are both incomplete and over-specified, failing to answer some queries that have real-world answers. We show that inserting this new QE module into a neural question-answering system leads to substantial improvements over the state-of-the-art.
  arXiv  Detail & Related papers  (2020-04-07T19:25:16Z)
• A Framework for Evaluation of Machine Reading Comprehension Gold Standards [7.6250852763032375]
  This paper proposes a unifying framework to investigate the present linguistic features, required reasoning and background knowledge and factual correctness. The absence of features that contribute towards lexical ambiguity, the varying factual correctness of the expected answers and the presence of lexical cues, all of which potentially lower the reading comprehension complexity and quality of the evaluation data.
  arXiv  Detail & Related papers  (2020-03-10T11:30:22Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.