Cited by 20Topic ModelingSemantic Web and OntologiesNatural Language Processing Techniques

Entity Enabled Relation Linking

Open access
Pan, Jeff Z., Zhang, Mei, Singh, Kuldeep, Harmelen, Frank van, Gu, Jinguang, Zhang, Zhi·2019·Lecture Notes in Computer Science

The claims and statistics of this paper haven’t been checked yet.

Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.

A few free checks a day · papers already verified open instantly · results are public

Integrity signals

Registry

Crossref · 10.1007/978-3-030-30793-6_30

Cites

1 of 1 references verified0 citation errors · 0 not checkable

Statistics

Claims the paper makes

The claims and statistics of this paper haven’t been checked yet.

Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.

A few free checks a day · papers already verified open instantly · results are public

Claims other papers make about this one

Each is checked against this paper’s own text: does it say what the citing paper says it does?

  • EERL discovers implicit relations by using domains and ranges of properties in the knowledge graph, but it cannot handle relation linking through relation paths.

    “For instance, EERL discovers the implicit relations by using the domains and ranges of properties in KG, but it cannot handle the issue of RL through relation paths.”

    From Implicit Relation Linking for Question Answering over Knowledge Graph (2022) · cites this paper as Pan et al., 2019

    The available Abstract describes EERL as using entities extracted from questions and DBpedia entities to compute relation candidates. Searches for property domains and ranges, implicit relations, and relation paths found no passage addressing those specific claims. The available copy therefore does not establish either the proposed mechanism or the asserted limitation. (LLM, conf=0.72)

    Experimental — accuracy not yet measured

Self-check

Percentages, sums and reported differences re-computed from the paper’s own numbers.

The self-check needs the paper’s full text.

Cites

Flagged first, then by citations

Cited by

Sorted by citations

Authors
Pan, J. Z., Zhang, M., Singh, K., Harmelen, F. V., Gu, J., & Zhang, Z.
Affiliations
  • University of Aberdeen (GB)
  • Wuhan University of Science and Technology (CN)
  • Vrije Universiteit Amsterdam (NL)
Corresponding author
Pan, Jeff Z.
Venue
Lecture Notes in Computer Science
Published
2019
Pages
523-538
ISSN
  • 0302-9743 (ISSN-L)
  • 1611-3349
OpenAlex
W2980646235
Cited by
20
References
1
Citations by year
2025: 2 · 2024: 1 · 2023: 4 · 2022: 5 · 2021: 6 · 2020: 2
FWCI
1.24
Type
conference paper
Language
en
Open access
Locations
  • Lecture notes in computer science (publishedVersion)
  • VU Research Portal (submittedVersion, other-oa)
  • Data Archiving and Networked Services (DANS) (submittedVersion, other-oa)
Topics
  • Physical Sciences › Computer Science › Artificial Intelligence › Topic Modeling
  • Physical Sciences › Computer Science › Artificial Intelligence › Semantic Web and Ontologies
  • Physical Sciences › Computer Science › Artificial Intelligence › Natural Language Processing Techniques
Keywords
knowledge graphs, question answering, named entity recognition, entity linking, DBpedia, natural language queries

About these checks

Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.

Statistics and arithmetic are recomputed, not judged.

Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.

What counts as a claim ›How we measure confidence ›How we check this ›

Are you an author, or do you see a problem with this page? Request a review