Word-level Human Interpretable Scoring Mechanism for Novel Text Detection Using Tsetlin Machines
Not on the map. Why?
Abstract (arXiv)
Recent research in novelty detection focuses mainly on document-level classification, employing deep neural networks (DNN). However, the black-box nature of DNNs makes it difficult to extract an exact explanation of why a document is considered novel. In addition, dealing with novelty at the word-level is crucial to provide a more fine-grained analysis than what is available at the document level. In this work, we propose a Tsetlin machine (TM)-based architecture for scoring individual words according to their contribution to novelty. Our approach encodes a description of the novel documents using the linguistic patterns captured by TM clauses. We then adopt this description to measure how much a word contributes to making documents novel. Our experimental results demonstrate how our approach breaks down novelty into interpretable phrases, successfully measuring novelty.
Key facts. Cited by 10 papers in the map (data through 7 Oct 2026). Builds on 24 of its 68 references that are in the map. First posted on arXiv 10 May 2021.
Builds on
24 of 68 references.
References · 24
- 2017Attention Is All You Needcited by 59,932
- 2018BERT: Pre-training of Deep Bidirectional Transformers for Language Understandingcited by 40,204
- 2016A Baseline for Detecting Misclassified and Out-of-Distribution Examples in Neural Networkscited by 2,362
- 2016iCaRL: Incremental Classifier and Representation Learningcited by 2,313
- 2018Deep contextualized word representationscited by 2,285
- 2019Attention is not Explanationcited by 916
- 2015Towards Open Set Deep Networkscited by 533
- 2019Is Attention Interpretable?cited by 387
- 2015Skip-Thought Vectorscited by 321
- 2019Attention in Natural Language Processingcited by 100
- 2016Learning Distributed Representations of Sentences from Unlabelled Datacited by 90
- 2018The Tsetlin Machine -- A Game Theoretic Bandit Driven Approach to Optimal Pattern Recognition with Propositional Logiccited by 71
12 more
- 2018Generative Adversarial Active Learning for Unsupervised Outlier Detectioncited by 65
- 2018Unsupervised Keyphrase Extraction with Multipartite Graphscited by 50
- 2019The Convolutional Tsetlin Machinecited by 37
- 2017Open-Category Classification by Adversarial Sample Generationcited by 24
- 2018Using the Tsetlin Machine to Learn Human-Interpretable Rules for High-Accuracy Text Categorization with Medical Applicationscited by 24
- 2020On the Convergence of Tsetlin Machines for the IDENTITY- and NOT Operatorscited by 23
- 2020Massively Parallel and Asynchronous Tsetlin Machine Architecture Supporting Almost Constant-Time Scalingcited by 20
- 2021On the Convergence of Tsetlin Machines for the XOR Operatorcited by 16
- 2020Measuring the Novelty of Natural Language Text Using the Conjunctive Clauses of a Tsetlin Machine Text Classifiercited by 15
- 2021Enhancing Interpretable Clauses Semantically using Pretrained Word Representationcited by 10
- 2018Novelty Detection with GANcited by 8
- 2019The Regression Tsetlin Machine: A Tsetlin Machine for Continuous Output Problemscited by 5
Built on by
Citing papers per year: 2021: 2; 2022: 0; 2023: 4; 2024: 3; 2025: 1.
10 papers.
- 2021Explainable Tsetlin Machine framework for fake news detection with credibility score assessmentcited by 23
- 2021Coalesced Multi-Output Tsetlin Machines with Clause Sharingcited by 22
- 2023Tsetlin Machine Embedding: Representing Words Using Logical Expressionscited by 15
- 2023Building Concise Logical Patterns by Constraining Tsetlin Machine Clause Sizecited by 14
- 2024Exploring State Space and Reasoning by Elimination in Tsetlin Machinescited by 4
- 2025Scalable Multi-phase Word Embedding Using Conjunctive Propositional Clausescited by 2
- 2023Contracting Tsetlin Machine with Absorbing Automatacited by 1
- 2024The Sparse Tsetlin Machine: Sparse Representation with Active Literalscited by 1
- 2023Generalized Convergence Analysis of Tsetlin Machines: A Probabilistic Approach to Concept Learningcited by 0
- 2024Pruning Literals for Highly Efficient Explainability at Word Levelcited by 0
- 2025Scalable Multi-phase Word Embedding Using Conjunctive Propositional Clauses31 Jan 2025
- 2024Pruning Literals for Highly Efficient Explainability at Word Level7 Nov 2024
- 2024Exploring State Space and Reasoning by Elimination in Tsetlin Machines12 Jul 2024
- 2024The Sparse Tsetlin Machine: Sparse Representation with Active Literals3 May 2024
- 2023Contracting Tsetlin Machine with Absorbing Automata17 Oct 2023
- 2023Generalized Convergence Analysis of Tsetlin Machines: A Probabilistic Approach to Concept Learning3 Oct 2023
- 2023Building Concise Logical Patterns by Constraining Tsetlin Machine Clause Size19 Jan 2023
- 2023Tsetlin Machine Embedding: Representing Words Using Logical Expressions2 Jan 2023
- 2021Coalesced Multi-Output Tsetlin Machines with Clause Sharing17 Aug 2021
- 2021Explainable Tsetlin Machine framework for fake news detection with credibility score assessment19 May 2021