Learning to extract symbolic knowledge from the World Wide Web
AAAI '98/IAAI '98 Proceedings of the fifteenth national/tenth conference on Artificial intelligence/Innovative applications of artificial intelligence
DIRT @SBT@discovery of inference rules from text
Proceedings of the seventh ACM SIGKDD international conference on Knowledge discovery and data mining
Relational Data Mining
Learning Logical Definitions from Relations
Machine Learning
ILP '96 Selected Papers from the 6th International Workshop on Inductive Logic Programming
Automatic acquisition of hyponyms from large text corpora
COLING '92 Proceedings of the 14th conference on Computational linguistics - Volume 2
COLING '02 Proceedings of the 19th international conference on Computational linguistics - Volume 1
Learning the structure of Markov logic networks
ICML '05 Proceedings of the 22nd international conference on Machine learning
Machine Learning
Semantic taxonomy induction from heterogenous evidence
ACL-44 Proceedings of the 21st International Conference on Computational Linguistics and the 44th annual meeting of the Association for Computational Linguistics
Preemptive information extraction using unrestricted relation discovery
HLT-NAACL '06 Proceedings of the main conference on Human Language Technology Conference of the North American Chapter of the Association of Computational Linguistics
Discriminative structure and parameter learning for Markov logic networks
Proceedings of the 25th international conference on Machine learning
Scaling textual inference to the web
EMNLP '08 Proceedings of the Conference on Empirical Methods in Natural Language Processing
ILP with noise and fixed example size: a Bayesian approach
IJCAI'97 Proceedings of the Fifteenth international joint conference on Artifical intelligence - Volume 2
Open information extraction from the web
IJCAI'07 Proceedings of the 20th international joint conference on Artifical intelligence
RTE '07 Proceedings of the ACL-PASCAL Workshop on Textual Entailment and Paraphrasing
Identifying functional relations in web text
EMNLP '10 Proceedings of the 2010 Conference on Empirical Methods in Natural Language Processing
Global learning of typed entailment rules
HLT '11 Proceedings of the 49th Annual Meeting of the Association for Computational Linguistics: Human Language Technologies - Volume 1
Learning entailment relations by global graph structure optimization
Computational Linguistics
Discovering commonsense entailment rules implicit in sentences
TIWTE '11 Proceedings of the TextInfer 2011 Workshop on Textual Entailment
Relation acquisition using word classes and partial patterns
EMNLP '11 Proceedings of the Conference on Empirical Methods in Natural Language Processing
Identifying relations for open information extraction
EMNLP '11 Proceedings of the Conference on Empirical Methods in Natural Language Processing
Open information extraction: the second generation
IJCAI'11 Proceedings of the Twenty-Second international joint conference on Artificial Intelligence - Volume Volume One
Efficient tree-based approximation for entailment graph learning
ACL '12 Proceedings of the 50th Annual Meeting of the Association for Computational Linguistics: Long Papers - Volume 1
Learning to "read between the lines" using Bayesian logic programs
ACL '12 Proceedings of the 50th Annual Meeting of the Association for Computational Linguistics: Long Papers - Volume 1
Crowdsourcing inference-rule evaluation
ACL '12 Proceedings of the 50th Annual Meeting of the Association for Computational Linguistics: Short Papers - Volume 2
Learning verb inference rules from linguistically-motivated evidence
EMNLP-CoNLL '12 Proceedings of the 2012 Joint Conference on Empirical Methods in Natural Language Processing and Computational Natural Language Learning
Knowledge extraction and joint inference using tractable Markov logic
AKBC-WEKEX '12 Proceedings of the Joint Workshop on Automatic Knowledge Base Construction and Web-scale Knowledge Extraction
AKBC-WEKEX '12 Proceedings of the Joint Workshop on Automatic Knowledge Base Construction and Web-scale Knowledge Extraction
Probabilistic databases of universal schema
AKBC-WEKEX '12 Proceedings of the Joint Workshop on Automatic Knowledge Base Construction and Web-scale Knowledge Extraction
Discovering logical knowledge for deep question answering
Proceedings of the 21st ACM international conference on Information and knowledge management
JELIA'12 Proceedings of the 13th European conference on Logics in Artificial Intelligence
Discriminative learning of first-order weighted abduction from partial discourse explanations
CICLing'13 Proceedings of the 14th international conference on Computational Linguistics and Intelligent Text Processing - Volume Part I
Discovering interesting information with advances in web technology
ACM SIGKDD Explorations Newsletter
AMIE: association rule mining under incomplete evidence in ontological knowledge bases
Proceedings of the 22nd international conference on World Wide Web
Mining frequent neighborhood patterns in a large labeled graph
Proceedings of the 22nd ACM international conference on Conference on information & knowledge management
Universal schema for entity type prediction
Proceedings of the 2013 workshop on Automated knowledge base construction
Statistical relational data integration for information extraction
RW'13 Proceedings of the 9th international conference on Reasoning Web: semantic technologies for intelligent data access
| Hi-index | 0.00 |
Even the entire Web corpus does not explicitly answer all questions, yet inference can uncover many implicit answers. But where do inference rules come from? This paper investigates the problem of learning inference rules from Web text in an unsupervised, domain-independent manner. The Sherlock system, described herein, is a first-order learner that acquires over 30,000 Horn clauses from Web text. Sherlock embodies several innovations, including a novel rule scoring function based on Statistical Relevance (Salmon et al., 1971) which is effective on ambiguous, noisy and incomplete Web extractions. Our experiments show that inference over the learned rules discovers three times as many facts (at precision 0.8) as the TextRunner system which merely extracts facts explicitly stated in Web text.