English
Related papers

Related papers: Combining Global and Local Merges in Logic-based E…

200 papers

Some of the greatest advances in web search have come from leveraging socio-economic properties of online user behavior. Past advances include PageRank, anchor text, hubs-authorities, and TF-IDF. In this paper, we investigate another…

Databases · Computer Science 2011-08-31 Jim Gemmell , Benjamin I. P. Rubinstein , Ashok K. Chandra

Data integration has been a long-standing challenge in data management with many applications. A key step in data integration is entity consolidation. It takes a collection of clusters of duplicate records as input and produces a single…

Entity resolution (ER) is about identifying and merging records in a database that represent the same real-world entity. Matching dependencies (MDs) have been introduced and investigated as declarative rules that specify ER policies. An ER…

Databases · Computer Science 2017-02-28 Zeinab Bahmani , Leopoldo Bertossi

Large Language Models (LLMs) have been used as relevance assessors for Information Retrieval (IR) evaluation collection creation due to reduced cost and increased scalability as compared to human assessors. While previous research has…

Information Retrieval · Computer Science 2026-01-06 Samaneh Mohtadi , Gianluca Demartini

Language models (LMs) are typically trained once on a large-scale corpus and used for years without being updated. However, in a dynamic world, new entities constantly arise. We propose a framework to analyze what LMs can infer about new…

Computation and Language · Computer Science 2022-05-06 Yasumasa Onoe , Michael J. Q. Zhang , Eunsol Choi , Greg Durrett

Entity matching is the task of deciding whether two entity descriptions refer to the same real-world entity. Entity matching is a central step in most data integration pipelines. Many state-of-the-art entity matching methods rely on…

Computation and Language · Computer Science 2024-10-21 Ralph Peeters , Aaron Steiner , Christian Bizer

Recently, Logic Explained Networks (LENs) have been proposed as explainable-by-design neural models providing logic explanations for their predictions. However, these models have only been applied to vision and tabular data, and they mostly…

Computation and Language · Computer Science 2023-09-28 Rishabh Jain , Gabriele Ciravegna , Pietro Barbiero , Francesco Giannini , Davide Buffelli , Pietro Lio

We propose a novel deep learning model for joint document-level entity disambiguation, which leverages learned neural representations. Key components are entity embeddings, a neural attention mechanism over local context windows, and a…

Computation and Language · Computer Science 2017-08-02 Octavian-Eugen Ganea , Thomas Hofmann

This paper is intended to provide an overview of how the evaluation of standards could be applied to entity resolution, or record linkage. Data quality is of critical importance for many AI applications, and the quality of data,…

Computers and Society · Computer Science 2025-08-19 Julia Lane

LLMs excel in localized code completion but struggle with repository-level tasks due to limited context windows and complex semantic and structural dependencies across codebases. While Retrieval-Augmented Generation (RAG) mitigates context…

Software Engineering · Computer Science 2025-09-09 Xingliang Wang , Baoyi Wang , Chen Zhi , Junxiao Han , Xinkui Zhao , Jianwei Yin , Shuiguang Deng

Entity suggestion by example (ESbE) refers to a type of entity acquisition query in which a user provides a set of example entities as the query and obtains in return some entities that best complete the concept underlying the given query.…

Information Retrieval · Computer Science 2015-12-01 Yi Zhang , Yanghua Xiao , Seung-won Hwang , Haixun Wang , X. Sean Wang , Wei Wang

In this paper, we report our discovery on named entity distribution in a general word embedding space, which helps an open definition on multilingual named entity definition rather than previous closed and constraint definition on named…

Computation and Language · Computer Science 2021-02-11 Ying Luo , Hai Zhao , Zhuosheng Zhang , Bingjie Tang

Querying is one of the basic functionality expected from a database system. Query efficiency is adversely affected by increase in the number of participating tables. Also, querying based on syntax largely limits the gamut of queries a…

Databases · Computer Science 2011-04-08 Gowri Shankar Ramaswamy , F Sagayaraj Francis

Aggregate analysis, such as comparing country-wise sales versus global market share across product categories, is often complicated by the unavailability of common join attributes, e.g., category, across diverse datasets from different…

Databases · Computer Science 2017-01-05 Karamjit Singh , Garima Gupta , Gautam Shroff , Puneet Agarwal

Achieving backward compatibility when rolling out new models can highly reduce costs or even bypass feature re-encoding of existing gallery images for in-production visual retrieval systems. Previous related works usually leverage losses…

Computer Vision and Pattern Recognition · Computer Science 2021-08-05 Qiang Meng , Chixiang Zhang , Xiaoqiang Xu , Feng Zhou

Named entities in text documents are the names of people, organization, location or other types of objects in the documents that exist in the real world. A persisting research challenge is to use computational techniques to identify such…

Computation and Language · Computer Science 2019-07-09 Abdulkareem Alsudais , Hovig Tchalian

Relation Extraction is an important task in Information Extraction which deals with identifying semantic relations between entity mentions. Traditionally, relation extraction is carried out after entity extraction in a "pipeline" fashion,…

Computation and Language · Computer Science 2021-03-11 Sachin Pawar , Pushpak Bhattacharyya , Girish K. Palshikar

Unification in Description Logics has been introduced as a means to detect redundancies in ontologies. We try to extend the known decidability results for unification in the Description Logic $\mathcal{EL}$ to disunification since negative…

Logic in Computer Science · Computer Science 2019-03-14 Franz Baader , Stefan Borgwardt , Barbara Morawska

Attribute and size reductions are key issues in formal concept analysis. In this paper, we consider a special kind of equivalence relation to reduce concept lattices, which will be called local congruence. This equivalence relation is based…

Data Structures and Algorithms · Computer Science 2024-09-25 Roberto G. Aragón , Jesús Medina , Eloísa Ramírez-Poussa

The natural join and the inner union operations combine relations of a database. Tropashko and Spight [24] realized that these two operations are the meet and join operations in a class of lattices, known by now as the relational lattices.…

Logic in Computer Science · Computer Science 2017-11-01 Luigi Santocanale
‹ Prev 1 3 4 5 6 7 10 Next ›