Difference between revisions of "Entity Linking"
Jump to navigation
Jump to search
Line 6: | Line 6: | ||
*[[CiteRef::Barba2022]] | *[[CiteRef::Barba2022]] | ||
*[[CiteRef::DBLP:conf/cla/AbbasDN20]] | *[[CiteRef::DBLP:conf/cla/AbbasDN20]] | ||
− | *[[CiteRef:: | + | *[[CiteRef::cochinwala2001ef]] |
*[[CiteRef::Koepcke2010]] | *[[CiteRef::Koepcke2010]] | ||
*[[CiteRef::Zwicklbauer2016]] | *[[CiteRef::Zwicklbauer2016]] | ||
Line 78: | Line 78: | ||
}} | }} | ||
− | {{#scite: | + | |
− | | | + | {{#scite: |
− | | | + | |reference=cochinwala2001ef |
+ | |type=journal-article | ||
|title=Efficient data reconciliation | |title=Efficient data reconciliation | ||
+ | |authors=Munir Cochinwala;Verghese Kurien;Gail Lalk;Dennis Shasha | ||
|journal=Information Sciences | |journal=Information Sciences | ||
− | | | + | |publisher=Elsevier BV |
+ | |issn=0020-0255 | ||
+ | |subject=Artificial Intelligence;Information Systems and Management;Computer Science Applications;Theoretical Computer Science;Control and Systems Engineering;Software|+sep=; | ||
|volume=137 | |volume=137 | ||
− | |pages= | + | |pages=1-15 |
− | |||
|doi=10.1016/s0020-0255(00)00070-0 | |doi=10.1016/s0020-0255(00)00070-0 | ||
+ | |year=2001 | ||
+ | |retrieved-from=https://doi.org/ | ||
+ | |retrieved-on=2023-03-06 | ||
}} | }} | ||
Revision as of 09:20, 6 March 2023
GlossaryEntry
GlossaryEntry | |
---|---|
responsible | |
state | |
since | |
description | Entity Linking |
references | |
lang | en |
master |
Tutorial
Links
- https://fca4ai.hse.ru/mirror/pubs/share/direct/497283251.pdf#page=125
- https://hal.archives-ouvertes.fr/hal-02921643/document
- NER
- Entity Resolution Computer Science Lecture 18 Duke University Spring 2013
- https://github.com/anhaidgroup/py_entitymatching/
- https://github.com/SapienzaNLP/extend
- https://paperswithcode.com/task/entity-linking/codeless#datasets
References
- ^ Barba2022
- ^ Nacira Abbas and Jérôme David and Amedeo Napoli. (2020) "Discovery of Link Keys in RDF Data Based on Pattern Structures: Preliminary Steps" - 235–246 pages. url: http://ceur-ws.org/Vol-2668/paper18.pdf
- ^ Munir Cochinwala;Verghese Kurien;Gail Lalk;Dennis Shasha. (2001) "Efficient data reconciliation" - 1-15 pages. doi: 10.1016/s0020-0255(00)00070-0
- ^ Hanna Köpcke and Andreas Thor and Erhard Rahm. (2010) "Evaluation of entity resolution approaches on real-world match problems" - 484–493 pages. doi: 10.14778/1920841.1920904at: VLDB 2010
- ^ Stefan Zwicklbauer and Christin Seifert and Michael Granitzer. (2016) "DoSeR - A Knowledge-Base-Agnostic Framework for Entity Disambiguation Using Semantic Embeddings" - 182–198 pages. doi: 10.1007/978-3-319-34129-3_12at: ESWC 2016
- ^ Tomer Sagi and Avigdor Gal and Omer Barkol and Ruth Bergman and Alexander Avram. (2016) "Multi-Source Uncertain Entity Resolution at Yad Vashem" . doi: 10.1145/2882903.2903737at: SIGMOD 2016
- ^ Edoardo Barba;Luigi Procopio;Roberto Navigli. (2022) "ExtEnD: Extractive Entity Disambiguation" . doi: 10.18653/v1/2022.acl-long.177at: ACL 2022