Vis enkel innførsel

dc.contributor.authorAl-Moslmi, Tareq Abdo Abdullah
dc.contributor.authorGallofré Ocaña, Marc
dc.contributor.authorOpdahl, Andreas Lothe
dc.contributor.authorVeres, Csaba
dc.date.accessioned2021-02-25T12:30:24Z
dc.date.available2021-02-25T12:30:24Z
dc.date.created2020-04-19T15:47:50Z
dc.date.issued2020
dc.PublishedIEEE Access. 2020, 8 32862-32881.
dc.identifier.issn2169-3536
dc.identifier.urihttps://hdl.handle.net/11250/2730423
dc.description.abstractAn enormous amount of digital information is expressed as natural-language (NL) text that is not easily processable by computers. Knowledge Graphs (KG) offer a widely used format for representing information in computer-processable form. Natural Language Processing (NLP) is therefore needed for mining (or lifting) knowledge graphs from NL texts. A central part of the problem is to extract the named entities in the text. The paper presents an overview of recent advances in this area, covering: Named Entity Recognition (NER), Named Entity Disambiguation (NED), and Named Entity Linking (NEL). We comment that many approaches to NED and NEL are based on older approaches to NER and need to leverage the outputs of state-of-the-art NER systems. There is also a need for standard methods to evaluate and compare named-entity extraction approaches. We observe that NEL has recently moved from being stepwise and isolated into an integrated process along two dimensions: the first is that previously sequential steps are now being integrated into end-to-end processes, and the second is that entities that were previously analysed in isolation are now being lifted in each other's context. The current culmination of these trends are the deep-learning approaches that have recently reported promising results.en_US
dc.language.isoengen_US
dc.publisherInstitute of Electrical and Electronics Engineersen_US
dc.rightsNavngivelse 4.0 Internasjonal*
dc.rights.urihttp://creativecommons.org/licenses/by/4.0/deed.no*
dc.titleNamed Entity Extraction for Knowledge Graphs: A Literature Overviewen_US
dc.typeJournal articleen_US
dc.typePeer revieweden_US
dc.description.versionpublishedVersionen_US
cristin.ispublishedtrue
cristin.fulltextoriginal
cristin.qualitycode1
dc.identifier.doi10.1109/ACCESS.2020.2973928
dc.identifier.cristin1807004
dc.source.journalIEEE Accessen_US
dc.source.408
dc.source.pagenumber32862-32881en_US
dc.relation.projectNorges forskningsråd: 275872en_US
dc.identifier.citationIEEE Access. 2020, 8, 32862-32881.en_US
dc.source.volume8en_US


Tilhørende fil(er)

Thumbnail

Denne innførselen finnes i følgende samling(er)

Vis enkel innførsel

Navngivelse 4.0 Internasjonal
Med mindre annet er angitt, så er denne innførselen lisensiert som Navngivelse 4.0 Internasjonal