Cited by 2,000Web Data Mining and AnalysisAI-based Problem Solving and PlanningNatural Language Processing Techniques

Toward an architecture for never-ending language learning

Open access
Carlson, Andrew, Betteridge, Justin, Kisiel, Bryan, Settles, Burr, Hruschka, Estevam, Mitchell, Tom·2010·Proceedings of the AAAI Conference on Artificial Intelligence

Abstract

We consider here the problem of building a never-ending language learner; that is, an intelligent computer agent that runs forever and that each day must (1) extract, or read, information from the web to populate a growing structured knowledge base, and (2) learn to perform this task better than on the previous day. In particular, we propose an approach and a set of design principles for such an agent, describe a partial implementation of such a system that has already learned to extract a knowledge base containing over 242,000 beliefs with an estimated precision of 74% after running for 67 days, and discuss lessons learned from this preliminary attempt to build a never-ending learning agent.

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.1609/aaai.v24i1.7519

Cites

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

  • The NELL data set consists of facts represented by a triplet which involves two entities and their relation.

    “It consists of facts represented by a triplet which involves two entities and their relation.”

    From A Comprehensive Survey on Graph Neural Networks (2021) · cites this paper as [130]

  • The NELL data set is a knowledge graph obtained from the Never-Ending Language Learning project.

    “The NELL data set is a knowledge graph obtained from the Never-Ending Language Learning project.”

    From A Comprehensive Survey on Graph Neural Networks (2021) · cites this paper as [130]

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: 1

  1. Curran, J. R.; Murphy, T.; and Scholz, B. 2007. Minimising semantic drift with mutual exclusion bootstrapping. In Proc. of PACLING .

Cited by

Sorted by citations

Authors
Carlson, A., Betteridge, J., Kisiel, B., Settles, B., Hruschka, E., & Mitchell, T.
Affiliations
Carnegie Mellon University (US)
Venue
Proceedings of the AAAI Conference on Artificial Intelligence
Published
2010-07-05
Volume
24
Issue
1
Pages
1306-1313
ISSN
  • 2159-5399 (ISSN-L)
  • 2374-3468
OpenAlex
W1512387364
Cited by
2,000
References
34
Citations by year
2026: 26 · 2025: 60 · 2024: 113 · 2023: 129 · 2022: 116 · 2021: 168 · 2020: 192 · 2019: 153 · 2018: 175 · 2017: 148 · 2016: 149 · 2015: 175 · 2014: 138 · 2013: 120 · 2012: 83
FWCI
57.32
Type
conference paper
Language
en
Open access
Locations
  • Proceedings of the AAAI Conference on Artificial Intelligence (publishedVersion)
  • AAAI Publications (The Association for the Advancement of Artificial Intelligence (AAAI)) (submittedVersion)
Funders
  • Conselho Nacional de Desenvolvimento Científico e Tecnológico
  • Defense Advanced Research Projects Agency (FA8750)
Topics
  • Physical Sciences › Computer Science › Information Systems › Web Data Mining and Analysis
  • Physical Sciences › Computer Science › Artificial Intelligence › AI-based Problem Solving and Planning
  • Physical Sciences › Computer Science › Artificial Intelligence › Natural Language Processing Techniques
Keywords
continual learning, web scraping, structured knowledge base, knowledge base population, design principles

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