), with the sequence (term,hypernym,gloss) when a gloss is available and (term,hypernym) otherwise. For each domain we release a
tree-like taxonomy (TREE) and two directed acyclic graph (DAG_1_3,DAG_0_99) obtained with different parameters of our graph-based approach.
We are realeasing the OWL/RDF version (
• owl
• owl
• owl
• owl
• owl
• owl
• owl
• owl
• owl
• owl
• owl
• owl
• owl
• owl
• owl
• owl
• owl
• owl
• owl
• owl
• owl
• owl
• owl
• owl| Paola Velardi, Stefano Faralli, Roberto Navigli. OntoLearn Reloaded: A Graph-based Algorithm for Taxonomy Induction. Computational Linguistics, 39(3), MIT Press, 2013. |