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. - 2481:(2019). (Intervento presentato al convegno Sixth Italian Conference on Computational Linguistics tenutosi a Bari; Italy).
WebIsAGraph: A very large hypernymy graph from a web corpus
Stefano Faralli;Irene Finocchi;Paola Velardi
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.| File | Dimensione | Formato | |
|---|---|---|---|
|
Faralli_WebIsAGraph_2019.pdf
accesso aperto
Tipologia:
Versione editoriale (versione pubblicata con il layout dell'editore)
Licenza:
Creative commons
Dimensione
389.32 kB
Formato
Adobe PDF
|
389.32 kB | Adobe PDF |
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
