Kernel methods for relation extraction
The Journal of Machine Learning Research
Web-scale information extraction in knowitall: (preliminary results)
Proceedings of the 13th international conference on World Wide Web
Ontologizing semantic relations
ACL-44 Proceedings of the 21st International Conference on Computational Linguistics and the 44th annual meeting of the Association for Computational Linguistics
RelEx---Relation extraction using dependency parse trees
Bioinformatics
Document Visualization Based on Semantic Graphs
IV '09 Proceedings of the 2009 13th International Conference Information Visualisation
Large-scale extraction and use of knowledge from text
Proceedings of the fifth international conference on Knowledge capture
Open information extraction from the web
IJCAI'07 Proceedings of the 20th international joint conference on Artifical intelligence
Constructing Event Templates from Written News
WI-IAT '09 Proceedings of the 2009 IEEE/WIC/ACM International Joint Conference on Web Intelligence and Intelligent Agent Technology - Volume 03
Unsupervised learning of semantic relations between concepts of a molecular biology ontology
IJCAI'05 Proceedings of the 19th international joint conference on Artificial intelligence
RelExt: a tool for relation extraction from text in ontology extension
ISWC'05 Proceedings of the 4th international conference on The Semantic Web
Hi-index | 0.00 |
In this paper, we present an approach providing generalized relations for automatic ontology building based on frequent word n-grams. Using publicly available Google n-grams as our data source we can extract relations in form of triples and compute generalized and more abstract models. We propose an algorithm for building abstractions of the extracted triples using WordNet as background knowledge. We also present a novel approach to triple extraction using heuristics, which achieves notably better results than deep parsing applied on n-grams. This allows us to represent information gathered from the web as a set of triples modeling the common and frequent relations expressed in natural language. Our results have potential for usage in different settings including providing for a knowledge base for reasoning or simply as statistical data useful in improving understanding of natural languages.