In this paper, we present WebIsAGraph, a very large hypernymy graph compiled from a dataset of is-a relationships extracted from the CommonCrawl. We provide the resource together with a Neo4j plugin to enable efficient searching and querying over such large graph. We use WebIsAGraph to study the problem of detecting polysemous terms in a noisy terminological knowledge graph, thus quantifying the degree of polysemy of terms found in is-a extractions from Web text.

WebIsAGraph: A Very Large Hypernymy Graph from a Web Corpus / Faralli, Stefano; Finocchi, Irene; Paolo Ponzetto, Simone; Velardi, Paola. - Proceedings of the Sixth Italian Conference on Computational Linguistics, (2019), pp. - (Sixth Italian Conference on Computational Linguistics, Bari, Italy

WebIsAGraph: A Very Large Hypernymy Graph from a Web Corpus

Irene Finocchi;
2019

Abstract

In this paper, we present WebIsAGraph, a very large hypernymy graph compiled from a dataset of is-a relationships extracted from the CommonCrawl. We provide the resource together with a Neo4j plugin to enable efficient searching and querying over such large graph. We use WebIsAGraph to study the problem of detecting polysemous terms in a noisy terminological knowledge graph, thus quantifying the degree of polysemy of terms found in is-a extractions from Web text.
2019
knowledge graph; polysemic terms
File in questo prodotto:
File Dimensione Formato  
paper30.pdf

Solo gestori archivio

Tipologia: Versione dell'editore
Licenza: DRM (Digital rights management) non definiti
Dimensione 389.32 kB
Formato Adobe PDF
389.32 kB Adobe PDF   Visualizza/Apri
Pubblicazioni consigliate

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/11385/192535
Citazioni
  • Scopus 2
  • ???jsp.display-item.citation.isi??? ND
  • OpenAlex ND
social impact