Mining Generalized Associations of Semantic Relations from Textual Web Content
IEEE Transactions on Knowledge and Data Engineering
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
The Google Similarity Distance
IEEE Transactions on Knowledge and Data Engineering
Tree-Traversing Ant Algorithm for term clustering based on featureless similarities
Data Mining and Knowledge Discovery
Clustering for unsupervised relation identification
Proceedings of the sixteenth ACM conference on Conference on information and knowledge management
Learning non-taxonomic relationships from web documents for domain ontology construction
Data & Knowledge Engineering
Constructing a Global Ontology by Concept Mapping Using Wikipedia Thesaurus
AINAW '08 Proceedings of the 22nd International Conference on Advanced Information Networking and Applications - Workshops
Identifying concept attributes using a classifier
DeepLA '05 Proceedings of the ACL-SIGLEX Workshop on Deep Lexical Acquisition
SCARLET: semantic relation discovery by harvesting online ontologies
ESWC'08 Proceedings of the 5th European semantic web conference on The semantic web: research and applications
RelExt: a tool for relation extraction from text in ontology extension
ISWC'05 Proceedings of the 4th international conference on The Semantic Web
COLING '10 Proceedings of the 23rd International Conference on Computational Linguistics: Posters
Ontology learning from text: A look back and into the future
ACM Computing Surveys (CSUR)
Journal of Web Engineering
Hi-index | 0.00 |
Common techniques for acquiring semantic relations rely on static domain and linguistic resources, predefined patterns, and the presence of syntactic cues. We propose a hybrid approach which brings together established and novel techniques in lexical simplification, word disambiguation and association inference for acquiring coarse-grained relations between potentially ambiguous and composite terms using only dynamic Web resources. Our experiments using terms from two different domains demonstrate potential preliminary results.