paper-with-me

홈 › Papers

Enriching Knowledge Bases with Counting Quantifiers

2018-07-10 · Paramita Mirza, Simon Razniewski, Fariz Darari, Gerhard Weikum

Information extraction traditionally focuses on extracting relations between identifiable entities, such as <Monterey, locatedIn, California>. Yet, texts often also contain Counting information, stating that a subject is in a specific relation with a number of objects, without mentioning the objects themselves, for example, "California is divided into 58 counties". Such counting quantifiers can help in a variety of tasks such as query answering or knowledge base curation, but are neglected by prior work. This paper develops the first full-fledged system for extracting counting information from text, called CINEX. We employ distant supervision using fact counts from a knowledge base as training seeds, and develop novel techniques for dealing with several challenges: (i) non-maximal training seeds due to the incompleteness of knowledge bases, (ii) sparse and skewed observations in text sources, and (iii) high diversity of linguistic patterns. Experiments with five human-evaluated relations show that CINEX can achieve 60% average precision for extracting counting information. In a large-scale experiment, we demonstrate the potential for knowledge base enrichment by applying CINEX to 2,474 frequent relations in Wikidata. CINEX can assert the existence of 2.5M facts for 110 distinct relations, which is 28% more than the existing Wikidata facts for these relations.

📄 PDF Abstract BibTeX arXiv:1807.03656

Code (1)

paramitamirza/CINEX 공식 구현

Similar Papers 제목 키워드 기반

Expressive Power of Deep Homomorphism Networks over Relational Databases

2026-05-18 · Moritz Schönherr, Balder ten Cate, Maurice Funk, Benny Kimelfeld 외 arxiv

The expressive limitations of message-passing Graph Neural Networks (GNNs) have motivated a wide range of more powerful graph learning architectures. We advocate Deep Homomorphism Networks (DHNs) as a model particularly …

Graph Learning

Weighted First-Order Model Counting in the Two-Variable Fragment With Counting Quantifiers

2020-07-10 · Ondrej Kuzelka

It is known due to the work of Van den Broeck et al [KR, 2014] that weighted first-order model counting (WFOMC) in the two-variable fragment of first-order logic can be solved in time polynomial in the number of domain e…

A Fast Model Counting Algorithm for Two-Variable Logic with Counting and Modulo Counting Quantifiers

2026-05-05 · Shixin Sun, Astrid Klipfel, Ondřej Kuželka, Yuanhong Wang 외 arxiv

Weighted first-order model counting (WFOMC) is a central task in lifted probabilistic inference: It asks for the weighted sum of all models of a first-order sentence over a finite domain. A long line of work has identifi…

Weighted Model Counting in FO2 with Cardinality Constraints and Counting Quantifiers: A Closed Form Formula

2021-10-12 · Sagar Malhotra, Luciano Serafini

Weighted First-Order Model Counting (WFOMC) computes the weighted sum of the models of a first-order logic theory on a given finite domain. First-Order Logic theories that admit polynomial-time WFOMC w.r.t domain cardina…

Form

Skolemization for Weighted First-Order Model Counting

2013-12-19 · Guy Van den Broeck, Wannes Meert, Adnan Darwiche

First-order model counting emerged recently as a novel reasoning task, at the core of efficient algorithms for probabilistic logics. We present a Skolemization algorithm for model counting problems that eliminates existe…

model