Pith. sign in

REVIEW 4 major objections 5 minor 62 references

Knowledge Bases in Support of Large Language Models for Processing Web News

T0 review · 4 major / 5 minor · reviewed 2026-08-12 · deepseek-v4-flash

Challenge this review Re-run · record.json Download PDF Read on arXiv ↗ Review JSON

Pith's one-line read Structured news facts on a graph improve BERT's news classification.

desk verdict A clean BERT+OpenIE+GCN architecture with a plausible but statistically unsecured empirical claim; worth a serious referee, not acceptance as-is. read the letter →

arxiv 2411.08278 v2 pith:PEHTTLQI submitted 2024-11-13 cs.CL cs.AI

Yihe Zhang , Nabin Pakka , Nian-Feng Tzeng This is my paper · ORCID
classification cs.CLcs.AI
keywords BERTknowledgebasesnewsclassificationgraphconvolutionalnetworksinformationextractionrelationtuplesfine-tuningoverfitting
verification ladder T0 review T1 audit T2 compute T3 formal

The pith

A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.

The reading

The paper tries to establish that a large language model can do better at news classification when its unstructured output is combined with explicit relational structure extracted from the same text. It proposes BERTGraph, which appends a graph convolutional network to BERT, and NewsIE, a rule-based extractor that turns each news item into a small knowledge base of subject-predicate-object tuples. The authors claim that this structured information complements the implicit knowledge BERT learned during pretraining, improving classification without retraining or modifying BERT itself. On three public news datasets, BERTGraph outperforms plain BERT on nearly every reported metric, with the only exception being precision on the PolitiFact dataset. If the claim is right, it offers a lightweight recipe for injecting explicit knowledge into language models in low-resource settings.

What carries the argument

The load-bearing mechanism is a per-news knowledge base: a small graph whose nodes are chunk-level entities, such as subjects, objects, and complements, and whose edges are predicate-argument relations. NewsIE builds these graphs using dependency parsing and part-of-speech tagging, then classifies each clause type and aggregates elements into relation tuples. A text-to-graph adapter pools BERT's token embeddings over each extracted node to create node features, and a graph convolutional layer propagates information across the extracted edges. Dummy nodes fill missing arguments so that even a bare intransitive clause becomes a graph.

What would settle it

One concrete test is to run BERTGraph against a control with the same graph size but randomized edges; if accuracy remains unchanged, the edge structure carries no information. Another is to manually audit a sample of extracted tuples and check whether BERTGraph's advantage over BERT concentrates in documents whose tuples are wrong, which would show the gain is not due to accurate structured knowledge.

Watch

Extended reading notes

Core claim

The central claim is that adding explicit relational structure to BERT's output, rather than to its input or its encoder, improves downstream news category classification. The paper reports that BERTGraph beats BERT on F1, accuracy, and precision on the Snopes and N24News datasets, and on F1 and accuracy on PolitiFact, with the single exception of PolitiFact precision at 0.27 versus 0.28. The authors also claim that the structural information mitigates overfitting: as the fine-tuning training set grows, plain BERT's scores eventually decline while BERTGraph's keep rising. They position BERTGraph against systems that change BERT's input format or encoder structure, arguing those changes destroy the pretrained embedding and force expensive retraining.

Load-bearing premise

The whole advantage rests on NewsIE's hand-crafted rules extracting clean, useful relation tuples from arbitrary news text, and the paper never measures how often those rules are correct.

Editorial extensions

If this is right

  • Because BERT itself is left untouched, the same graph-convolution appendage could be attached to other pretrained encoders, making structured augmentation available to many language models.
  • The reported gains in low-data settings imply that explicit structure acts as a regularizer, which would matter for tasks where labeled examples are scarce.
  • NewsIE requires no labeled extraction data, so knowledge bases can be generated automatically at scale for new news corpora without annotation effort.
  • The framework's stated question, whether structured knowledge bases can enhance LLM downstream tasks, is answered affirmatively for news classification, inviting the same design to be tested on other document-level tasks.

Reading between the lines

Editorial extensions of the paper, not claims the author makes directly.

  • A direct test of whether the graph structure itself matters would compare BERTGraph against a version with randomly permuted or deleted edges; if the accuracy gain disappears, the relational layout is doing the work.
  • The same pooling-and-convolution recipe could be tried on other event-heavy text tasks, such as claim verification or narrative understanding, since the extractor only needs subject-predicate-object structure.
  • Because NewsIE's rules are hand-crafted for English news, porting the framework to other languages or genres would likely require rewriting the rules, and that port would be a useful stress test of the general claim.
Share X Bluesky LinkedIn Reddit HN

Signed reviews

No signed human review yet.

Editorial analysis

A structured set of objections, weighed in public.

Desk editor's note, referee report, and a circularity audit.

Referee Report

4 major / 5 minor

Summary. The paper proposes BERTGraph, a framework that augments BERT with knowledge bases automatically extracted by a rule-based News Information Extractor (NewsIE). NewsIE parses news text into relational tuples and clause-type structures; the Text-to-Graph Adapter pools BERT token embeddings over extracted nodes, and a GCN then acts on these pooled features together with the extracted graph edges. The framework is evaluated for news category classification on N24News, Snopes, and Politifact, comparing BERTGraph against BERT, two BERTGraph variants, and two GCN-only baselines, under varying training-set sizes (5%–80%). The paper claims BERTGraph outperforms BERT on almost all metrics and that the structured information helps mitigate overfitting during fine-tuning.

Significance. If the reported improvements are reproducible, BERTGraph is an attractive lightweight design: it leaves the BERT architecture and input format unchanged, requires no task-specific annotation for the knowledge graphs, and uses only a small GCN on top. The underlying question—whether automatically extracted explicit structure can complement implicit LLM knowledge—is timely and relevant. The paper also provides a reasonably concrete description of the extraction rules and the graph-construction procedure, which would let others re-implement the system. However, the evidence as presented is not yet sufficient to support the central claim: the gains are small, are reported from what appear to be single runs without error bars or significance tests, the ablations do not isolate the graph contribution, and the NewsIE output is never validated. The Politifact results are near chance and are not explained. With additional experiments and tightened reporting, the paper could become a solid empirical study.

major comments (4)
  1. [§4.4.1, Tables 1 and 2, Fig. 5] The central claim that BERTGraph outperforms BERT rests on differences that are small relative to typical fine-tuning variance, yet the paper gives no number of seeds, standard deviations, confidence intervals, or significance tests. For example, at 10% training, the Snopes F1 gain is 0.68 vs 0.66, and at 80% the gains are about +0.05–0.07 on each metric. These margins can easily be produced by run-to-run noise in fine-tuned BERT. The authors should run multiple seeds for each configuration, report mean ± std or confidence intervals, and perform a paired significance test (e.g., paired bootstrap or matched-pair t-test). Without this, the observed differences are not distinguishable from noise.
  2. [§4.4.1, BERTGraph-s and BERTGraph-l] The two 'variants' do not control for the graph contribution in the way the discussion implies. BERTGraph-s uses BERT without any fine-tuning, and BERTGraph-l fine-tunes only the last layer; neither adds the GCN to an otherwise identical BERT fine-tuning pipeline. Therefore the relative gains of BERTGraph over BERT could come from the extra capacity of the GCN, from different fine-tuning dynamics, or from the structured graphs—the paper cannot attribute them to the knowledge bases. A proper ablation should compare BERT plus a GCN on the same graph architecture with (a) the real NewsIE graphs, (b) random or shuffled graphs, and (c) no graph information (e.g., an MLP of equivalent parameter count), while keeping BERT's fine-tuning identical across conditions.
  3. [§3.2] NewsIE is a load-bearing component, but its output is never evaluated. The paper provides no precision, recall, or sample-based accuracy of the extracted relational tuples, nor any error analysis. It also acknowledges that dependency parsing can be ambiguous and that NER is used to rectify results. Without evidence that the extracted graphs are reasonably accurate, the improvements (if real) could be artifacts of the specific rule set or of noise rather than a general property of structured augmentation. I ask the authors to report an evaluation of NewsIE, for example precision on a random sample of extractions or a comparison with an existing OpenIE benchmark, and to include an ablation with corrupted or random graphs to test sensitivity.
  4. [§4.4.1, Table 1] The prose reporting of results conflicts with the table values. For N24News, the text says BERTGraph achieves 'F1, Acc, and Pre scores of 0.68, 0.71 of 0.68,' while Table 1 lists 0.68, 0.69, and 0.67; the stated improvement percentages (4%, 5%, 2%) do not match the table entries. Additionally, the paper's claim that BERTGraph outperforms BERT 'in terms of all performance metrics' is contradicted by Politifact precision (0.27 vs 0.28) at 10% training. The near-chance Politifact F1 of 0.29 on a 6-class task is also not discussed. These inconsistencies and unexplained near-random results undermine confidence in the empirical claims and must be corrected.
minor comments (5)
  1. [§3.2.3] In the Element Aggregation paragraph, the 'SVA' clause type is described as linking the predicate node to 'its adverbial node ('V')'; this should be the adverbial node ('A'). The same typo appears in Figure 4.
  2. [§4.4.1] The first paragraph of Section 4.4.1 refers to 'BERTGraph-0 and BERTGraph-1' whereas later text uses 'BERTGraph-s' and 'BERTGraph-l'. Please use consistent names throughout.
  3. [§4.3] The experimental setup lists '4 layers of GNN' but does not specify exactly which GCN variant is used, the activation function, dropout, or whether early stopping is applied. Adding these details would improve reproducibility.
  4. [References] Several references appear mismatched: [5] is cited as a dependency parser but the entry is Danqi Chen and Christopher Manning's 2014 EMNLP paper (correct in itself), while [6] is cited as a 'greedy parser' but the entry is WebSRC. Please verify every numbered citation against its entry.
  5. [Figures 2–4] The figures are difficult to read: font sizes are very small, and Figure 3 does not clearly show how the Customized Pooling Layers are generated from the knowledge base. Larger, higher-resolution versions with more explicit annotations would help.

Circularity Check

0 steps flagged · score 0.0 of 10

No circularity: the reported gains are empirical held-out comparisons, and the knowledge-base graph is built from input text by fixed hand-written rules, not from labels or from the predicted outputs.

full rationale

BERTGraph's claimed contribution is an empirical architecture comparison: BERT plus a GCN over NewsIE-extracted relational tuples versus BERT alone, evaluated on held-out splits of Snopes, N24News, and Politifact. The graph is produced from the input text by hand-written dependency-parsing and POS rules (Section 3.2), not from classification labels or from the reported metrics; the GCN is trained on labeled data, but the predicted category is not used to construct the knowledge base. No equation in the paper defines a fitted quantity as the reported metric, and no load-bearing result is imported from prior work by the same authors. The closest to a self-referential step is the interpretation in Sections 4.4.1 and 4.4.2 that observed gains show structural information 'helps' BERT and 'mitigates overfitting'; this is an interpretation of measurements, not a derivation from the model construction. Weaknesses such as missing error bars, unvalidated NewsIE precision/recall, and the confusing description of BERTGraph-s are experimental-rigor issues, not circularity. No self-citations by the present authors are used, and the external references (BERT, ClausIE, GCN) are standard prior work rather than a chain that forces the conclusion. Therefore no circular step can be exhibited under the required standard.

Assumptions & free parameters 5 free parameters · 4 assumptions · 1 invented entities

The central claim depends on the quality of the hand-crafted NewsIE rules and on the assumptions that BERT embeddings are useful and that GCNs can work on these small graphs. The hyperparameters are standard choices without systematic tuning.

free parameters (5)
  • Learning rate = 1e-5
    Chosen by hand for BERT fine-tuning; no sweep reported (Section 4.3).
  • Batch size = 16
    Chosen by hand (Section 4.3).
  • GCN layers = 4
    Number of graph convolution layers, chosen by hand; no ablation (Section 4.3).
  • GCN hidden dimension = 768
    Matches BERT hidden size; no ablation (Section 4.3).
  • NewsIE rule set
    Hand-crafted chunk extraction and clause classification rules; no systematic tuning or evaluation of extraction accuracy (Section 3.2).
assumptions (4)
  • domain assumption BERT base produces contextualized token embeddings sufficient for text classification after fine-tuning.
    The framework is built entirely on BERT's embeddings (Section 3.1.1).
  • domain assumption SpaCy dependency parsing and named entity recognition are accurate enough for the rule-based extraction.
    NewsIE relies on these tools; the paper notes ambiguity but does not quantify errors (Section 3.2).
  • domain assumption The public news dataset labels are learnable from text.
    Politifact's near-random results suggest this may not hold for all datasets (Section 4.4).
  • domain assumption Graph convolutional networks can effectively propagate information on small, noisy graphs.
    The GCN is used without architectural justification or comparison to simpler aggregators (Section 3.1.1).
invented entities (1)
  • DUMMY node
    purpose: Placeholder node inserted to form a triple for SV clauses in the knowledge base graph.
    Introduced in Section 3.2.3; it has no meaning beyond enabling a uniform graph format.

how reviews work

0 comments
Cite this review

Pith. "Pith review of Knowledge Bases in Support of Large Language Models for Processing Web News." pith.science (2026). https://pith.science/paper/PEHTTLQI

@misc{pith2026241108278,
  author       = {Pith},
  title        = {Pith review of: Knowledge Bases in Support of Large Language Models for Processing Web News},
  year         = {2026},
  howpublished = {\url{https://pith.science/paper/PEHTTLQI}},
  note         = {Machine review of arXiv:2411.08278}
}
read the original abstract

Large Language Models (LLMs) have received considerable interest in wide applications lately. During pre-training via massive datasets, such a model implicitly memorizes the factual knowledge of trained datasets in its hidden parameters. However, knowledge held implicitly in parameters often makes its use by downstream applications ineffective due to the lack of common-sense reasoning. In this article, we introduce a general framework that permits to build knowledge bases with an aid of LLMs, tailored for processing Web news. The framework applies a rule-based News Information Extractor (NewsIE) to news items for extracting their relational tuples, referred to as knowledge bases, which are then graph-convoluted with the implicit knowledge facts of news items obtained by LLMs, for their classification. It involves two lightweight components: 1) NewsIE: for extracting the structural information of every news item, in the form of relational tuples; 2) BERTGraph: for graph convoluting the implicit knowledge facts with relational tuples extracted by NewsIE. We have evaluated our framework under different news-related datasets for news category classification, with promising experimental results.

Figures

Figures reproduced from arXiv: 2411.08278 by the authors.

Figure 1
Figure 1. Illustration of Knowledge Base (left) and Large [PITH_FULL_IMAGE:figures/full_fig_p001_1.png] view at source ↗
Figure 2
Figure 2. Overview of BERTGraph framework. 0 1 2 3 Graph Convoluntion Layer Customized Pooling BERT Output Pooling Output From NewsIE Node Edge [PITH_FULL_IMAGE:figures/full_fig_p004_2.png] view at source ↗
Figure 3
Figure 3. The design of Text-to-Graph Adapter. called the Customized Pooling Layer, which averages the token embeddings of its associated nodes, where the embeddings are from the BERT outputs, as depicted in [PITH_FULL_IMAGE:figures/full_fig_p004_3.png] view at source ↗
Figures from the paper (2 more)
Figure 4
Figure 4. Figure 4: The sequence of clause type identification. [PITH_FULL_IMAGE:figures/full_fig_p006_4.png]
Figure 5
Figure 5. Figure 5: F1 score, accuracy, precision under various training [PITH_FULL_IMAGE:figures/full_fig_p008_5.png]

Discussion (0). Continue with ORCID to comment.

Reference graph

Works this paper leans on

62 extracted references · 47 canonical work pages

  1. [1]

    Alan Akbik and Alexander Löser. 2012. Kraken: N-ary facts in open information extraction. In Proceedings of the Joint Workshop on Automatic Knowledge Base Construction and Web-scale Knowledge Extraction (AKBC-WEKEX). 52–56

    work page 2012

  2. [2]

    Gabor Angeli, Melvin Jose Johnson Premkumar, and Christopher D Manning

    work page

  3. [3]

    Zhen Bi, Siyuan Cheng, Ningyu Zhang, Xiaozhuan Liang, Feiyu Xiong, and Huajun Chen. 2022. Relphormer: relational graph transformer for knowledge graph representation. arXiv preprint arXiv:2205.10852 (2022)

    work page Pith review arXiv 2022

  4. [4]

    Joan Bruna, Wojciech Zaremba, Arthur Szlam, and Yann LeCun. 2013. Spec- tral networks and locally connected networks on graphs. arXiv preprint arXiv:1312.6203 (2013)

    arXiv 2013

  5. [5]

    Danqi Chen and Christopher D Manning. 2014. A fast and accurate dependency parser using neural networks. In Proceedings of the 2014 Conference on Empirical Methods in Natural Language Processing (EMNLP) . 740–750

    work page 2014

  6. [6]

    Xingyu Chen, Zihan Zhao, Lu Chen, Jiabao Ji, Danyang Zhang, Ao Luo, Yuxuan Xiong, and Kai Yu. 2021. WebSRC: A Dataset for Web-Based Structural Reading Comprehension. In Proceedings of the 2021 Conference on Empirical Methods in Natural Language Processing. 4173–4185

    work page 2021

  7. [7]

    E.T Chourdakis and J.D. Reiss. 2018. Grammar Informed Sound Effect Retrieval for Soundscape Generation. In DMRN+ 13: Digital Music Research Network One- day Workshop. London, UK, 9

    work page 2018

  8. [8]

    Janara Christensen, Stephen Soderland, Oren Etzioni, et al . 2010. Semantic role labeling for open information extraction. In Proceedings of the NAACL HLT 2010 first international workshop on formalisms and methodology for learning by reading. 52–60

    work page 2010

Show all 62 references
  1. [9]

    Mike Coombe. 2023. Chatsonic – Best ChatGPT Alternative for Content Creation. Writesonic. https://writesonic.com/chat

    2023

  2. [10]

    Lei Cui, Furu Wei, and Ming Zhou. 2018. Neural open information extraction. arXiv preprint arXiv:1805.04270 (2018)

    2018 arXiv

  3. [11]

    Marie-Catherine De Marneffe, Christopher D Manning, Joakim Nivre, and Daniel Zeman. 2021. Universal dependencies. Computational Linguistics 47, 2 (2021), 255–308

    2021

  4. [12]

    Michaël Defferrard, Xavier Bresson, and Pierre Vandergheynst. 2016. Convolu- tional neural networks on graphs with fast localized spectral filtering. Advances in neural information processing systems 29 (2016)

    2016

  5. [13]

    Luciano Del Corro and Rainer Gemulla. 2013. Clausie: clause-based open infor- mation extraction. In Proceedings of the 22nd international conference on World Wide Web. 355–366

    2013

  6. [14]

    M Fabian, Kasneci Gjergji, WEIKUM Gerhard, et al . 2007. Yago: A core of semantic knowledge unifying wordnet and wikipedia. In16th International world wide web conference, WWW . 697–706

    2007

  7. [15]

    Anthony Fader, Stephen Soderland, and Oren Etzioni. 2011. Identifying relations for open information extraction. InProceedings of the 2011 conference on empirical methods in natural language processing . 1535–1545

    2011

  8. [16]

    Mickel Hoang, Oskar Alija Bihorac, and Jacobo Rouces. 2019. Aspect-based sentiment analysis using bert. In Proceedings of the 22nd Nordic Conference on Computational Linguistics. 187–196

    2019

  9. [17]

    Matthew Honnibal and Mark Johnson. 2015. An improved non-monotonic transition system for dependency parsing. In Proceedings of the 2015 conference on empirical methods in natural language processing . 1373–1378

    2015

  10. [18]

    Matthew Honnibal, Ines Montani, Sofie Van Landeghem, Adriane Boyd, et al

  11. [19]

    Zhiheng Huang, Wei Xu, and Kai Yu. 2015. Bidirectional LSTM-CRF models for sequence tagging. arXiv preprint arXiv:1508.01991 (2015)

    2015 arXiv

  12. [20]

    Jacob Devlin Ming-Wei Chang Kenton and Lee Kristina Toutanova. 2019. Bert: Pre-training of deep bidirectional transformers for language understanding. In Proceedings of NAACL-HLT, Vol. 1. 2

    2019

  13. [21]

    Diederik P Kingma and Jimmy Ba. 2014. Adam: A method for stochastic opti- mization. arXiv preprint arXiv:1412.6980 (2014)

    2014 arXiv

  14. [22]

    Paul R Kingsbury and Martha Palmer. 2002. From TreeBank to PropBank. In LREC. 1989–1993

    2002

  15. [24]

    Thomas N Kipf and Max Welling. 2016. Semi-supervised classification with graph convolutional networks. arXiv preprint arXiv:1609.02907 (2016)

    2016 arXiv

  16. [25]

    Boshko Koloski, Timen Stepišnik Perdih, Marko Robnik-Šikonja, Senja Pollak, and Blaž Škrlj. 2022. Knowledge graph informed fake news classification via heterogeneous representation ensembles. Neurocomputing 496 (2022), 208–226

    2022

  17. [26]

    Nathaniel Krasner, Miriam Wanner, and Antonios Anastasopoulos. 2022. Revisit- ing the Effects of Leakage on Dependency Parsing.arXiv preprint arXiv:2203.12815 (2022)

    2022 arXiv

  18. [27]

    Jens Lehmann, Robert Isele, Max Jakob, Anja Jentzsch, Dimitris Kontokostas, Pablo N Mendes, Sebastian Hellmann, Mohamed Morsey, Patrick Van Kleef, Sören Auer, et al. 2015. Dbpedia–a large-scale, multilingual knowledge base extracted from wikipedia. Semantic Web 6, 2 (2015), 167–195

    2015

  19. [28]

    Bill Yuchen Lin, Ying Sheng, Nguyen Vo, and Sandeep Tata. 2020. Freedom: A transferable neural architecture for structured information extraction on web documents. In Proceedings of the 26th ACM SIGKDD International Conference on Knowledge Discovery & Data Mining . 1092–1102

    2020

  20. [29]

    Weijie Liu, Peng Zhou, Zhe Zhao, Zhiruo Wang, Qi Ju, Haotang Deng, and Ping Wang. 2020. K-bert: Enabling language representation with knowledge graph. In Proceedings of the AAAI Conference on Artificial Intelligence , Vol. 34. 2901–2908

    2020

  21. [30]

    Yinhan Liu, Myle Ott, Naman Goyal, Jingfei Du, Mandar Joshi, Danqi Chen, Omer Levy, Mike Lewis, Luke Zettlemoyer, and Veselin Stoyanov. 2019. Roberta: A robustly optimized bert pretraining approach. arXiv preprint arXiv:1907.11692 (2019)

    2019 arXiv

  22. [31]

    Xuezhe Ma and Eduard Hovy. 2016. End-to-end sequence labeling via bi- directional lstm-cnns-crf. arXiv preprint arXiv:1603.01354 (2016)

    2016 arXiv

  23. [32]

    James Manyika. 2023. An overview of Bard: an early experiment with generative AI. https://ai.google/static/documents/google-about-bard.pdf

    2023

  24. [33]

    Mausam Mausam. 2016. Open information extraction systems and downstream applications. In Proceedings of the twenty-fifth international joint conference on artificial intelligence. 4074–4077

    2016

  25. [35]

    Mohit Mayank, Shakshi Sharma, and Rajesh Sharma. 2022. DEAP-FAKED: Knowl- edge graph based approach for fake news detection. In 2022 IEEE/ACM Interna- tional Conference on Advances in Social Networks Analysis and Mining (ASONAM) . IEEE, 47–51

    2022

  26. [36]

    Brian McBride. 2004. The resource description framework (RDF) and its vocabu- lary description language RDFS. In Handbook on Ontologies. Springer, 51–65

    2004

  27. [37]

    George A Miller. 1995. WordNet: a lexical database for English. Commun. ACM 38, 11 (1995), 39–41

    1995

  28. [38]

    Christopher Morris, Martin Ritzert, Matthias Fey, William L Hamilton, Jan Eric Lenssen, Gaurav Rattan, and Martin Grohe. 2019. Weisfeiler and leman go neural: Higher-order graph neural networks. In Proceedings of the AAAI conference on artificial intelligence, Vol. 33. 4602–4609

    2019

  29. [39]

    Thi-Nhu Nguyen, Hideaki Takeda, Khai Nguyen, Ryutaro Ichise, and Tuan-Dung Cao. 2016. Type Prediction for Entities in DBpedia by Aggregating Multilingual Resources. In ISWC (Posters & Demos). Citeseer

    2016

  30. [40]

    Slav Petrov, Dipanjan Das, and Ryan McDonald. 2012. A Universal Part-of- Speech Tagset. In Proceedings of the Eighth International Conference on Language Resources and Evaluation (LREC’12) . 2089–2096

    2012

  31. [41]

    Politifact. 2023. https://www.politifact.com/

    2023

  32. [42]

    Peng Qi, Yuhao Zhang, Yuhui Zhang, Jason Bolton, and Christopher D Manning

  33. [43]

    Nishant Rai, Deepika Kumar, Naman Kaushik, Chandan Raj, and Ahad Ali. 2022. Fake News Classification using transformer based enhanced LSTM and BERT. International Journal of Cognitive Computing in Engineering 3 (2022), 98–105

    2022

  34. [44]

    Michael Schmitz, Stephen Soderland, Robert Bart, Oren Etzioni, et al. 2012. Open language learning for information extraction. In Proceedings of the 2012 joint conference on empirical methods in natural language processing and computational natural language learning. 523–534

    2012

  35. [45]

    In Proceedings of the 58th Annual Meeting of the Association for Computational Linguistics: System Demonstrations

    Stanza: A Python Natural Language Processing Toolkit for Many Human Languages. In Proceedings of the 58th Annual Meeting of the Association for Computational Linguistics: System Demonstrations . 101–108

  36. [46]

    John Schulman et. al. 2022. Introducing ChatGPT. https://openai.com/blog/ chatgpt

    2022

  37. [47]

    Snopes. 2023. https://www.snopes.com/

    2023

  38. [48]

    2005.VerbNet: A broad-coverage, comprehensive verb lexicon

    Karin Kipper Schuler. 2005.VerbNet: A broad-coverage, comprehensive verb lexicon. University of Pennsylvania

    2005

  39. [49]

    Chi Sun, Xipeng Qiu, Yige Xu, and Xuanjing Huang. 2019. How to fine-tune bert for text classification?. In Chinese Computational Linguistics: 18th China National Conference. Springer, 194–206

    2019

  40. [50]

    Ashish Vaswani, Noam Shazeer, Niki Parmar, Jakob Uszkoreit, Llion Jones, Aidan N Gomez, Łukasz Kaiser, and Illia Polosukhin. 2017. Attention is all you need. Advances in Neural Information Processing Systems 30 (2017)

    2017

  41. [51]

    Gabriel Stanovsky, Jessica Ficler, Ido Dagan, and Yoav Goldberg. 2016. Getting more out of syntax with props. arXiv preprint arXiv:1603.01648 (2016)

    2016 arXiv

  42. [52]

    Jiapeng Wang, Tianwei Wang, Guozhi Tang, Lianwen Jin, Weihong Ma, Kai Ding, and Yichao Huang. 2021. Tag, copy or predict: a unified weakly-supervised learning framework for visual information extraction using sequences. arXiv preprint arXiv:2106.10681 (2021)

    2021 arXiv

  43. [53]

    Qifan Wang, Yi Fang, Anirudh Ravula, Fuli Feng, Xiaojun Quan, and Dongfang Liu. 2022. Webformer: The web-page transformer for structure information extraction. In Proceedings of the ACM Web Conference 2022 . 3124–3133. Zhang and Pakka, et al

    2022

  44. [54]

    Daheng Wang, Prashant Shiralkar, Colin Lockard, Binxuan Huang, Xin Luna Dong, and Meng Jiang. 2021. TCN: table convolutional network for web table interpretation. In Proceedings of the Web Conference 2021 . 4020–4032

    2021

  45. [55]

    Aaron Steven White, Drew Reisinger, Keisuke Sakaguchi, Tim Vieira, Sheng Zhang, Rachel Rudinger, Kyle Rawlins, and Benjamin Van Durme. 2016. Universal decompositional semantics on universal dependencies. In Proceedings of the 2016 Conference on Empirical Methods in Natural Lan...

    2016

  46. [56]

    Fei Wu and Daniel S Weld. 2010. Open information extraction using wikipedia. In Proceedings of the 48th annual meeting of the association for computational linguistics. 118–127

    2010

  47. [57]

    Zhen Wang, Xu Shan, Xiangxie Zhang, and Jie Yang. 2021. N24news: A new dataset for multimodal news classification. arXiv preprint arXiv:2108.13327 (2021)

    2021 arXiv

  48. [58]

    Zhilin Yang, Zihang Dai, Yiming Yang, Jaime Carbonell, Russ R Salakhutdinov, and Quoc V Le. 2019. Xlnet: Generalized autoregressive pretraining for language understanding. Advances in Neural Information Processing Systems 32 (2019)

    2019

  49. [59]

    Liang Yao, Chengsheng Mao, and Yuan Luo. 2019. KG-BERT: BERT for knowledge graph completion. arXiv preprint arXiv:1909.03193 (2019)

    2019 arXiv

  50. [60]

    Hu Xu, Bing Liu, Lei Shu, and Philip S Yu. 2019. BERT post-training for review reading comprehension and aspect-based sentiment analysis. arXiv preprint arXiv:1904.02232 (2019)

    2019 arXiv

  51. [61]

    Si Zhang, Hanghang Tong, Jiejun Xu, and Ross Maciejewski. 2019. Graph convo- lutional networks: a comprehensive review. Computational Social Networks 6, 1 (2019), 1–23

    2019

  52. [63]

    Alexander Yates, Michele Banko, Matthew Broadhead, Michael J Cafarella, Oren Etzioni, and Stephen Soderland. 2007. Textrunner: open information extrac- tion on the web. In Proceedings of Human Language Technologies: The Annual Conference of the North American Chapter of the As...

    2007

  53. [2015]

    Leveraging linguistic structure for open domain information extraction. In Proceedings of the 53rd Annual Meeting of the Association for Computational Lin- guistics and the 7th International Joint Conference on Natural Language Processing (Volume 1: Long Papers). 344–354

  54. [2020]

    spaCy: Industrial-strength natural language processing in python. (2020)

    2020

Pith tools

Reviewed August 12, 2026 · model on record in the stance chip above.