NELL
Related Papers
Random Walk Inference and Learning in A Large Scale Knowledge Base
We consider the problem of performing learn- ing and inference in a large scale knowledge base containing imperfect knowledge with incomplete coverage. We show that a soft inference procedure based …...
Which Noun Phrases Denote Which Concepts?
Resolving polysemy and synonymy is re- quired for high-quality information extraction. We present ConceptResolver, a component for the Never-Ending Language Learner (NELL) (Carlson et al., 2010) that handles both phe- …...
Incorporating Vector Space Similarity in Random Walk Inference over Knowledge Bases
Much work in recent years has gone into the construction of large knowledge bases (KBs), such as Freebase, DBPedia, NELL, and YAGO. While these KBs are very large, they are …...
An Entity-centric Approach for Overcoming Knowledge Graph Sparsity
Automatic construction of knowledge graphs (KGs) from unstructured text has received considerable attention in recent research, resulting in the con- struction of several KGs with millions of entities (nodes) and …...
Jointly Embedding Relations and Mentions for Knowledge Population
This paper contributes a joint embedding model for predicting relations between a pair of entities in the scenario of rela- tion inference. It differs from most stand- alone approaches which …...
Adapting Meta Knowledge Graph Information for Multi-Hop Reasoning over Few-Shot Relations
AbstractMulti-hop knowledge graph (KG) reasoning is an effective and explainable method for predicting the target entity via reasoning paths in query answering (QA) task. Most previous methods assume that every …...
Dynamic Anticipation and Completion for Multi-Hop Reasoning over Sparse Knowledge Graph
AbstractMulti-hop reasoning has been widely studied in recent years to seek an effective and interpretable method for knowledge graph (KG) completion. Most previous reasoning methods are designed for dense KGs …...