In our research on the use of information extraction to help populate the semantic web, we have encountered significant obstacles to interoperability. One such obstacle is cross-document coreference resolution. In this paper we describe an effort to improve coreference resolution on RDF graphs generated by text analytics. In addition to driving knowledge-base population, our goal is to demonstrate that successfully combining semantic web and natural language processing technologies can offer advantages over either in isolation, and motivates overcoming the obstacles to interoperability. We present some early results that show improvement of coreference resolution using graph-matching algorithms over RDF.
Coreference resolution on RDF Graphs generated from Information Extraction: first results / Yatskevich, Mikalai; Welty, Christopher; Murdock, J. William. - ELETTRONICO. - (2006), pp. 1-12.
Coreference resolution on RDF Graphs generated from Information Extraction: first results
Yatskevich, Mikalai;
2006-01-01
Abstract
In our research on the use of information extraction to help populate the semantic web, we have encountered significant obstacles to interoperability. One such obstacle is cross-document coreference resolution. In this paper we describe an effort to improve coreference resolution on RDF graphs generated by text analytics. In addition to driving knowledge-base population, our goal is to demonstrate that successfully combining semantic web and natural language processing technologies can offer advantages over either in isolation, and motivates overcoming the obstacles to interoperability. We present some early results that show improvement of coreference resolution using graph-matching algorithms over RDF.File | Dimensione | Formato | |
---|---|---|---|
057.pdf
accesso aperto
Tipologia:
Versione editoriale (Publisher’s layout)
Licenza:
Tutti i diritti riservati (All rights reserved)
Dimensione
127.95 kB
Formato
Adobe PDF
|
127.95 kB | Adobe PDF | Visualizza/Apri |
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione