Utilizing Graph Measure to Deduce Omitted Entities in Paragraphs
This demo deals with the problem of capturing omitted arguments in relation extraction given a proper knowledge base for entities of interest. This paper introduces the concept of a salient entity and use this information to deduce omitted entities in the paragraph which allows improving the relation extraction quality. The main idea to compute salient entities is to construct a graph on the given information (by identifying the entities but without parsing it), rank it with standard graph measures and embed it in the context of the sentences.
Code (0)
등록된 구현이 없습니다.
Tasks
Question AnsweringRelationRelation ExtractionRelationship Extraction (Distant Supervised)Similar Papers 제목 키워드 기반
Probing Omissions and Distortions in Transformer-based RDF-to-Text Models
In Natural Language Generation (NLG), important information is sometimes omitted in the output text. To better understand and analyse how this type of mistake arises, we focus on RDF-to-Text generation and explore two me…
Binary ClassificationText GenerationSimulation-Based Sensitivity Analysis in Optimal Treatment Regimes and Causal Decomposition with Individualized Interventions
Causal decomposition analysis aims to assess the effect of modifying risk factors on reducing social disparities in outcomes. Recently, this analysis has incorporated individual characteristics when modifying risk factor…
BenchmarkingSensitivityThe Effect of Omitted Variables on the Sign of Regression Coefficients
We show that, depending on how the impact of omitted variables is measured, it can be substantially easier for omitted variables to flip coefficient signs than to drive them to zero. This behavior occurs with "Oster's de…
regressionSelection biasDrug Similarity and Link Prediction Using Graph Embeddings on Medical Knowledge Graphs
The paper utilizes the graph embeddings generated for entities of a large biomedical database to perform link prediction to capture various new relationships among different entities. A novel node similarity measure is p…
Knowledge GraphsLink PredictionPredictionOne Subgraph for All: Efficient Reasoning on Opening Subgraphs for Inductive Knowledge Graph Completion
Knowledge Graph Completion (KGC) has garnered massive research interest recently, and most existing methods are designed following a transductive setting where all entities are observed during training. Despite the great…
AllGraph ClassificationInductive knowledge graph completionKnowledge Graph Completion