ISA-bEL: Intelligent Search Algorithm based on Entity Linking

• URL: http://arxiv.org/abs/2205.04322v1
• Date: Mon, 9 May 2022 14:26:52 GMT
• Title: ISA-bEL: Intelligent Search Algorithm based on Entity Linking
• Abstract summary: We propose a natural language processing pipeline based on a knowledge graph. Entities fed with context will be projected to a specific domain supported by a knowledge graph. These linked entities serve then as a key for searching a top level aggregation concept within our knowledge graph.
• Score: 0.0
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Nowadays, the way in which the people interact with computers has changed. Text- or voice-based interfaces are being widely applied in different industries. Among the most used ways of processing the user input are those based on intents or retrieval algorithms. In these solutions, important information of the user could be lost in the process. For the proposed natural language processing pipeline the entities are going to take a principal role, under the assumption that entities are where the purpose of the user resides. Entities fed with context will be projected to a specific domain supported by a knowledge graph, resulting in what has been named as linked entities. These linked entities serve then as a key for searching a top level aggregation concept within our knowledge graph.

Related papers

• Beyond Semantic Similarity: Rethinking Retrieval for Agentic Search via Direct Corpus Interaction [127.64173950476702]
  We study direct corpus interaction (DCI), where an agent searches the raw corpus directly with general-purpose terminal tools.<n>This approach requires no offline indexing and adapts naturally to evolving local corpora.<n>Across IR benchmarks and end-to-end agentic search tasks, this simple setup substantially outperforms strong sparse, dense, and reranking baselines.
  arXiv  Detail & Related papers  (2026-05-03T19:13:11Z)
• Text-to-SPARQL Goes Beyond English: Multilingual Question Answering Over Knowledge Graphs through Human-Inspired Reasoning [51.203811759364925]
  mKGQAgent breaks down the task of converting natural language questions into SPARQL queries into modular, interpretable subtasks.<n> Evaluated on the DBpedia- and Corporate-based KGQA benchmarks within the Text2SPARQL challenge 2025, our approach took first place among the other participants.
  arXiv  Detail & Related papers  (2025-07-22T19:23:03Z)
• Knowledge Graph Completion with Relation-Aware Anchor Enhancement [50.50944396454757]
  We propose a relation-aware anchor enhanced knowledge graph completion method (RAA-KGC) We first generate anchor entities within the relation-aware neighborhood of the head entity. Then, by pulling the query embedding towards the neighborhoods of the anchors, it is tuned to be more discriminative for target entity matching.
  arXiv  Detail & Related papers  (2025-04-08T15:22:08Z)
• The Ontoverse: Democratising Access to Knowledge Graph-based Data Through a Cartographic Interface [33.861478826378054]
  We have developed a unique approach to data navigation that leans on geographical visualisation and hierarchically structured domain knowledge. Our approach uses natural language processing techniques to extract named entities from the underlying data and normalise them against relevant semantic domain references and navigational structures. This allows end-users to identify entities relevant to their needs and access extensive graph analytics.
  arXiv  Detail & Related papers  (2024-07-22T10:29:25Z)
• Entity Disambiguation via Fusion Entity Decoding [68.77265315142296]
  We propose an encoder-decoder model to disambiguate entities with more detailed entity descriptions. We observe +1.5% improvements in end-to-end entity linking in the GERBIL benchmark compared with EntQA.
  arXiv  Detail & Related papers  (2024-04-02T04:27:54Z)
• DIVKNOWQA: Assessing the Reasoning Ability of LLMs via Open-Domain Question Answering over Knowledge Base and Text [73.68051228972024]
  Large Language Models (LLMs) have exhibited impressive generation capabilities, but they suffer from hallucinations when relying on their internal knowledge. Retrieval-augmented LLMs have emerged as a potential solution to ground LLMs in external knowledge.
  arXiv  Detail & Related papers  (2023-10-31T04:37:57Z)
• DiscoverPath: A Knowledge Refinement and Retrieval System for Interdisciplinarity on Biomedical Research [96.10765714077208]
  Traditional keyword-based search engines fall short in assisting users who may not be familiar with specific terminologies. We present a knowledge graph-based paper search engine for biomedical research to enhance the user experience. The system, dubbed DiscoverPath, employs Named Entity Recognition (NER) and part-of-speech (POS) tagging to extract terminologies and relationships from article abstracts to create a KG.
  arXiv  Detail & Related papers  (2023-09-04T20:52:33Z)
• Dynamic Named Entity Recognition [5.9401550252715865]
  We introduce a new task: Dynamic Named Entity Recognition (DNER) DNER provides a framework to better evaluate the ability of algorithms to extract entities by exploiting the context. We evaluate baseline models and present experiments reflecting issues and research axes related to this novel task.
  arXiv  Detail & Related papers  (2023-02-16T15:50:02Z)
• Nested Named Entity Recognition from Medical Texts: An Adaptive Shared Network Architecture with Attentive CRF [53.55504611255664]
  We propose a novel method, referred to as ASAC, to solve the dilemma caused by the nested phenomenon. The proposed method contains two key modules: the adaptive shared (AS) part and the attentive conditional random field (ACRF) module. Our model could learn better entity representations by capturing the implicit distinctions and relationships between different categories of entities.
  arXiv  Detail & Related papers  (2022-11-09T09:23:56Z)
• Personal Entity, Concept, and Named Entity Linking in Conversations [4.759142872591625]
  We introduce a collection and a tool for entity linking in conversations. We collect EL annotations for 1327 conversational utterances, consisting of links to named entities, concepts, and personal entities. The dataset is used for training our toolkit for conversational entity linking, CREL.
  arXiv  Detail & Related papers  (2022-06-15T22:32:29Z)
• Improving Candidate Retrieval with Entity Profile Generation for Wikidata Entity Linking [76.00737707718795]
  We propose a novel candidate retrieval paradigm based on entity profiling. We use the profile to query the indexed search engine to retrieve candidate entities. Our approach complements the traditional approach of using a Wikipedia anchor-text dictionary.
  arXiv  Detail & Related papers  (2022-02-27T17:38:53Z)
• Open Domain Question Answering over Virtual Documents: A Unified Approach for Data and Text [62.489652395307914]
  We use the data-to-text method as a means for encoding structured knowledge for knowledge-intensive applications, i.e. open-domain question answering (QA) Specifically, we propose a verbalizer-retriever-reader framework for open-domain QA over data and text where verbalized tables from Wikipedia and triples from Wikidata are used as augmented knowledge sources. We show that our Unified Data and Text QA, UDT-QA, can effectively benefit from the expanded knowledge index, leading to large gains over text-only baselines.
  arXiv  Detail & Related papers  (2021-10-16T00:11:21Z)
• ConCET: Entity-Aware Topic Classification for Open-Domain Conversational Agents [9.870634472479571]
  We introduce ConCET: a Concurrent Entity-aware conversational Topic classifier. We propose a simple and effective method for generating synthetic training data. We evaluate ConCET on a large dataset of human-machine conversations with real users, collected as part of the Amazon Alexa Prize.
  arXiv  Detail & Related papers  (2020-05-28T06:29:08Z)
• Automatic Discovery of Novel Intents & Domains from Text Utterances [18.39942131996558]
  We propose a novel framework, ADVIN, to automatically discover novel domains and intents from large volumes of unlabeled data. ADVIN significantly outperforms baselines on three benchmark datasets, and real user utterances from a commercial voice-powered agent.
  arXiv  Detail & Related papers  (2020-05-22T00:47:10Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.