mlsanityData to 14 Oct 2026

Explainability in Neural Networks for Natural Language Processing Tasks

arXiv 2412.18036 ↗First posted 23 Dec 2024cs.CL cs.AIcited by 6

Not on the map. Why?

Abstract (arXiv)

Neural networks are widely regarded as black-box models, creating significant challenges in understanding their inner workings, especially in natural language processing (NLP) applications. To address this opacity, model explanation techniques like Local Interpretable Model-Agnostic Explanations (LIME) have emerged as essential tools for providing insights into the behavior of these complex systems. This study leverages LIME to interpret a multi-layer perceptron (MLP) neural network trained on a text classification task. By analyzing the contribution of individual features to model predictions, the LIME approach enhances interpretability and supports informed decision-making. Despite its effectiveness in offering localized explanations, LIME has limitations in capturing global patterns and feature interactions. This research highlights the strengths and shortcomings of LIME and proposes directions for future work to achieve more comprehensive interpretability in neural NLP models.

Key facts. Cited by 6 papers in the map (data through 14 Oct 2026). Builds on 5 of its 14 references that are in the map. First posted on arXiv 23 Dec 2024.

Builds on

5 of 14 references.

References · 5

  1. 2017Towards A Rigorous Science of Interpretable Machine Learningcited by 1,416
  2. 2019Predictive Biases in Natural Language Processing Models: A Conceptual Framework and Overviewcited by 137
  3. 2021Model Explainability in Deep Learning Based Natural Language Processingcited by 14
  4. 2024Ethio-Fake: Cutting-Edge Approaches to Combat Fake News in Under-Resourced Languages Using Explainable AIcited by 8
  5. 2023First Attempt at Building Parallel Corpora for Machine Translation of Northeast India's Very Low-Resource Languagescited by 7

Built on by

Cited by year (2026 to 14 Oct)

Citing papers per year: 2025: 5; 2026: 1.

6 papers.