CoChat
Sign Up
Cited by 111Topic ModelingNatural Language Processing TechniquesSemantic Web and Ontologies

EARL: Joint Entity and Relation Linking for Question Answering over Knowledge Graphs

Open access
Dubey, Mohnish, Banerjee, Debayan, Chaudhuri, Debanjan, Lehmann, Jens·2018·Lecture Notes in Computer Science
DOI 10.1007/978-3-030-00671-6_7
Open this paper in CoChat — free accountOpen PDF

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-00671-6_7

Cites

2 of 2 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?

  • EARL models the linking problem as the generalized traveling salesman problem and uses connection density to link entities and relations jointly.

    “EARL (Dubey et al., 2018) models the linking problem as the generalized traveling salesman problem, and uses connection density to link entities and relations jointly.”

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

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

Research works printed but not linked: 26

  1. [1]1. J. Berant, A. Chou, R. Frostig, and P. Liang. Semantic parsing on freebase from questionanswer pairs. In EMNLP , volume 2, page 6, 2013.
  2. [2]2. A. Both, D. Diefenbach, K. Singh, S. Shekarpour, D. Cherix, and C. Lange. Qanary-a methodology for vocabulary-driven open question answering systems. In International Semantic Web Conference , pages 625-641. Springer, 2016.
  3. [3]3. R. Collobert, J. Weston, L. Bottou, M. Karlen, K. Kavukcuoglu, and P. Kuksa. Natural language processing (almost) from scratch. Journal of Machine Learning Research , 12(Aug):2493-2537, 2011.
  4. [4]4. M. Dubey, S. Dasgupta, A. Sharma, K. Höffner, and J. Lehmann. Asknow: A framework for natural language query formalization in sparql. In International Semantic Web Conference , pages 300-316. Springer, 2016.
  5. [5]5. D. Gerber and A.-C. N. Ngomo. Bootstrapping the linked data web. In 1st Workshop on Web Scale Knowledge Extraction@ ISWC , volume 2011, 2011.
  6. [6]6. A. Gubichev and M. Then. Graph pattern matching: Do we have to reinvent the wheel? In Proceedings of Workshop on GRAph Data . ACM, 2014.
  7. [8]8. K. Höffner, S. Walter, E. Marx, R. Usbeck, J. Lehmann, and A.-C. Ngonga Ngomo. Survey on challenges of question answering in the semantic web. Semantic Web , 8(6):895-920, 2017.
  8. [10]10. G. Laporte, H. Mercure, and Y. Nobert. Generalized travelling salesman problem through n sets of nodes: the asymmetrical case. Discrete Applied Mathematics , 18(2):185 - 197, 1987.
  9. [11]11. D. Lukovnikov, A. Fischer, J. Lehmann, and S. Auer. Neural network-based question answering over knowledge graphs on word and character level. In Proceedings of the 26th International Conference on World Wide Web , pages 1211-1220, 2017.
  10. [12]12. P. N. Mendes, M. Jakob, A. García-Silva, and C. Bizer. Dbpedia spotlight: shedding light on the web of documents. In Proceedings of the 7th international conference on semantic systems , pages 1-8. ACM, 2011.
  11. [13]13. A. Moro, A. Raganato, and R. Navigli. Entity linking meets word sense disambiguation: a unified approach. Transactions of the Association for Computational Linguistics , 2014.
  12. [14]14. I. O. Mulang, K. Singh, and F. Orlandi. Matching natural language relations to knowledge graph properties for question answering. In Proceedings of the 13th International Conference on Semantic Systems , pages 89-96. ACM, 2017.
  13. [15]15. N. Nakashole, G. Weikum, and F. Suchanek. Patty: A taxonomy of relational patterns with semantic types. In Proceedings of the EMNLP 2012 , pages 1135-1145. Association for Computational Linguistics, 2012.
  14. [18]18. P. Ristoski and H. Paulheim. Rdf2vec: Rdf graph embeddings for data mining. In International Semantic Web Conference , pages 498-514. Springer, 2016.
  15. [19]19. I. V . Serban, A. García-Durán, C. Gulcehre, S. Ahn, S. Chandar, A. Courville, and Y. Bengio. Generating factoid questions with recurrent neural networks: The 30m factoid question-answer corpus. arXiv preprint arXiv:1603.06807 , 2016. · arXiv
  16. [20]20. K. Singh, I. O. Mulang, I. Lytra, M. Y. Jaradeh, A. Sakor, M.-E. Vidal, C. Lange, and S. Auer. Capturing knowledge in semantically-typed relational patterns to enhance relation linking. In Proceedings of the Knowledge Capture Conference , page 31. ACM, 2017.
  17. [21]21. K. Singh, A. S. Radhakrishna, A. Both, S. Shekarpour, I. Lytra, R. Usbeck, A. Vyas, A. Khikmatullaev, D. Punjani, et al. Why reinvent the wheel: Let's build question answering systems together. In Proceedings of the 2018 World Wide Web Conference on World Wide Web , pages 1247-1256. International World Wide Web Conferences Steering Committee, 2018.
  18. [22]22. R. Speck and A.-C. Ngonga Ngomo. Ensemble learning for named entity recognition. In The Semantic Web - ISWC 2014 , volume 8796 of Lecture Notes in Computer Science , pages 519-534. Springer International Publishing, 2014.
  19. [23]23. P. Trivedi, G. Maheshwari, M. Dubey, and J. Lehmann. Lc-quad: A corpus for complex question answering over knowledge graphs. In International Semantic Web Conference , pages 210-218. Springer, 2017.
  20. [24]24. R. J. Trudeau. Introduction to graph theory (corrected, enlarged republication. ed.), 1993.
  21. [25]25. C. Unger, L. Bühmann, J. Lehmann, A.-C. Ngonga Ngomo, D. Gerber, and P. Cimiano. Template-based question answering over rdf data. In Proceedings of the 21st international conference on World Wide Web , pages 639-648. ACM, 2012.
  22. [26]26. R. Usbeck, A.-C. N. Ngomo, M. Röder, D. Gerber, S. A. Coelho, S. Auer, and A. Both. Agdistis-graph-based disambiguation of named entities using linked data. In International Semantic Web Conference , pages 457-471. Springer, 2014.
  23. [27]27. A. P. B. Veyseh. Cross-lingual question answering using common semantic space. In TextGraphs@ NAACL-HLT , pages 15-19, 2016.
  24. [28]28. K. Xu, S. Zhang, Y. Feng, and D. Zhao. Answering natural language questions via phrasal semantic parsing. In Natural Language Processing and Chinese Computing . Springer, 2014.
  25. [29]29. Y. Yang and M.-W. Chang. S-mart: Novel tree-based structured learning algorithms applied to tweet entity linking. In ACL 2015 , 2015.
  26. [30]30. W.-t. Yih, M.-W. Chang, X. He, and J. Gao. Semantic parsing via staged query graph generation: Question answering with knowledge base. In Proceedings of the 53rd ACL Conf. , volume 1, pages 1321-1331, 2015.

Cited by

Sorted by citations

Authors
Dubey, M., Banerjee, D., Chaudhuri, D., & Lehmann, J.
Affiliations
University of Bonn (DE)
Corresponding author
Dubey, Mohnish
ORCID
Venue
Lecture Notes in Computer Science
Publisher
Springer International Publishing
Published
2018
Pages
108-126
ISSN
  • 0302-9743 (ISSN-L)
  • 1611-3349
DOI
10.1007/978-3-030-00671-6_7
OpenAlex
W2783727254
Cited by
111
References
2
Citations by year
2026: 2 · 2025: 4 · 2024: 9 · 2023: 15 · 2022: 18 · 2021: 21 · 2020: 13 · 2019: 26 · 2018: 3
FWCI
6.40
Type
conference paper
Language
en
Open access
Licence
Locations
  • Lecture notes in computer science (publishedVersion)
  • arXiv (Cornell University) (submittedVersion)
  • Publikationsdatenbank der Fraunhofer-Gesellschaft (Fraunhofer-Gesellschaft) (submittedVersion)
  • Fraunhofer-Publica (Fraunhofer-Gesellschaft) (submittedVersion)
  • arXiv (Cornell University) (cc-by)
Funders
Horizon 2020 Framework Programme (EU‐H2020, 642795, 688227)
Topics
  • Physical Sciences › Computer Science › Artificial Intelligence › Topic Modeling
  • Physical Sciences › Computer Science › Artificial Intelligence › Natural Language Processing Techniques
  • Physical Sciences › Computer Science › Artificial Intelligence › Semantic Web and Ontologies
Keywords
entity linking, question answering over knowledge graphs, knowledge graphs, re-ranking, earls

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