In this paper, we present ContrastMedium, an algorithm that transforms noisy semantic networks into full-fledged, clean taxonomies. ContrastMedium is able to identify the embedded taxonomy structure from a noisy knowledge graph without explicit human supervision such as, for instance, a set of manually selected input root and leaf concepts. This is achieved by leveraging structural information from a companion reference taxonomy, to which the input knowledge graph is linked (either automatically or manually). When used in conjunction with methods for hypernym acquisition and knowledge base linking, our methodology provides a complete solution for end-to-end taxonomy induction. We conduct experiments using automatically acquired knowledge graphs, as well as a SemEval benchmark, and show that our method is able to achieve high performance on the task of taxonomy induction.

The contrastmedium algorithm: Taxonomy induction from noisy knowledge graphswith just a few links / Faralli, S.; Panchenko, A.; Biemann, C.; Ponzetto, S. P.. - 1:(2017), pp. 590-600. (Intervento presentato al convegno 15th Conference of the European Chapter of the Association for Computational Linguistics, EACL 2017 tenutosi a esp) [10.18653/v1/e17-1056].

The contrastmedium algorithm: Taxonomy induction from noisy knowledge graphswith just a few links

Faralli S.
Co-primo
;
Ponzetto S. P.
Co-primo
2017

Abstract

In this paper, we present ContrastMedium, an algorithm that transforms noisy semantic networks into full-fledged, clean taxonomies. ContrastMedium is able to identify the embedded taxonomy structure from a noisy knowledge graph without explicit human supervision such as, for instance, a set of manually selected input root and leaf concepts. This is achieved by leveraging structural information from a companion reference taxonomy, to which the input knowledge graph is linked (either automatically or manually). When used in conjunction with methods for hypernym acquisition and knowledge base linking, our methodology provides a complete solution for end-to-end taxonomy induction. We conduct experiments using automatically acquired knowledge graphs, as well as a SemEval benchmark, and show that our method is able to achieve high performance on the task of taxonomy induction.
2017
15th Conference of the European Chapter of the Association for Computational Linguistics, EACL 2017
Taxonomy Induction; Noisy Knowledge Graphs; graph pruning
04 Pubblicazione in atti di convegno::04b Atto di convegno in volume
The contrastmedium algorithm: Taxonomy induction from noisy knowledge graphswith just a few links / Faralli, S.; Panchenko, A.; Biemann, C.; Ponzetto, S. P.. - 1:(2017), pp. 590-600. (Intervento presentato al convegno 15th Conference of the European Chapter of the Association for Computational Linguistics, EACL 2017 tenutosi a esp) [10.18653/v1/e17-1056].
File allegati a questo prodotto
Non ci sono file associati a questo prodotto.

I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.

Utilizza questo identificativo per citare o creare un link a questo documento: https://hdl.handle.net/11573/1621242
 Attenzione

Attenzione! I dati visualizzati non sono stati sottoposti a validazione da parte dell'ateneo

Citazioni
  • ???jsp.display-item.citation.pmc??? ND
  • Scopus 16
  • ???jsp.display-item.citation.isi??? 8
social impact