OSCR

Neural Turing Machines for efficient natural language summarization: architecture, optimization, and performance analysis.

Overview

Authors: Kartik Reddy Katti1, Kartikeya Reddy Katti1, Amanul Islam2
  1. Nocancer.ai, San Francisco, CA, United States
  2. Department of Computer Science, University of Colorado, Colorado Springs, CO, United States
Journal: Frontiers in artificial intelligence, volume 9, article 1889866
Dates: received 24 May 2026; accepted 3 August 2026; published online 31 August 2026
Type: Research article · Language: English
License: CC BY
Identifiers: DOI 10.3389/frai.2026.1889866 · PMID 42741109 · PMCID PMC13572678 · OpenAlex W7204828769
Open access: gold, a free copy (OpenAlex)
Status: data only
Categories: cognitive (subfield)
Methods: Connectivity, Machine learning
Keywords: computational efficiency, deep learning, external memory, natural language processing, Neural Turing Machines, text summarization
Topic: Topic Modeling (Artificial Intelligence, Computer Science), according to OpenAlex
Citations: not cited yet (Europe PMC); 24 references in the paper

Abstract

Introduction: Abstractive text summarization remains a fundamental challenge in Natural Language Processing (NLP), particularly for long documents that require models to preserve long-range dependencies and maintain semantic coherence. Although Transformer-based architectures have achieved strong summarization performance, their full self-attention mechanism scales quadratically with sequence length and often requires input truncation in long-context applications.

Methods: This study presents a Neural Turing Machine (NTM)-based framework for abstractive text summarization. The proposed architecture combines a two-layer Bidirectional Long Short-Term Memory (BiLSTM) controller with an addressable external memory bank. Differentiable read and write operations decouple contextual storage from recurrent computation, enabling the persistent retrieval of salient information across extended input sequences. Detailed preprocessing, implementation, training, decoding, and evaluation settings are provided to support reproducibility. The framework was evaluated on the CNN/Daily Mail benchmark and compared with LSTM, Transformer, and BART baselines, as well as published high-performing systems, including PEGASUS, SimCLS, and BRIO. Ablation studies, learning-rate sensitivity analysis, long-context evaluation, inference-time scaling, statistical testing, qualitative error analysis, and memory-access visualization were also conducted.

Results: The proposed NTM model achieved ROUGE-1, ROUGE-2, ROUGE-L, and BLEU scores of 47.8, 23.5, 44.6, and 20.1, respectively. Under the controlled experimental protocol, it outperformed the evaluated LSTM, Transformer, and BART baselines. Comparisons with published results indicate that the model is competitive with recent high-performing summarization systems. The additional analyses demonstrate that the external memory mechanism improves contextual retention and summarization stability, particularly for longer input sequences, while exhibiting favorable inference-time scaling behavior.

Discussion: These findings demonstrate that integrating an addressable external memory with a BiLSTM controller offers an effective approach to abstractive summarization, particularly when processing long documents. The proposed framework provides competitive summarization performance while reducing dependence on computationally expensive full self-attention. The results highlight the potential of external-memory architectures as a scalable and stable alternative for long-context text summarization.

Reproduced under the paper's license (CC BY), from the paper cited above.

Code

The paper links to its data, not to its authors' code: see the Data section.

The paper's code and data availability statement is in the Data section.

Tracing map

A tracing map links a paper to the code its authors published: this paper has none, so it has no map.

Data

Datasets cited

Data availability statement

Publicly available datasets were analyzed in this study. This data can be found here: https://github.com/abisee/cnn-dailymail.

Reproduced under the paper's license (CC BY), from the paper cited above.

Versions

The history of this record: each version stored by the harvester or made by a correction of its authors or of the maintainers of its code, and what changed in its facts. The texts of the paper (its abstract, its availability statements) are not part of it; versions that changed only those are not listed.

Version 1, 27 September 2026: the first record

Recorded: type, language, journal, volume, pages, dates, 3 authors, 6 keywords, 11 references.

Cite

This paper

Katti, K. R., Katti, K. R., & Islam, A. (2026). Neural Turing Machines for efficient natural language summarization: architecture, optimization, and performance analysis. Frontiers in artificial intelligence, 9, 1889866. https://doi.org/10.3389/frai.2026.1889866

BibTeX

@article{katti2026neural,
author = {Katti, Kartik Reddy and Katti, Kartikeya Reddy and Islam, Amanul},
title = {{Neural Turing Machines for efficient natural language summarization: architecture, optimization, and performance analysis}},
journal = {Frontiers in artificial intelligence},
year = {2026},
month = aug,
volume = {9},
pages = {1889866},
publisher = {Frontiers Media SA},
issn = {2624-8212},
doi = {10.3389/frai.2026.1889866},
url = {https://doi.org/10.3389/frai.2026.1889866},
pmid = {42741109},
pmcid = {PMC13572678}
}

RIS

TY - JOUR
AU - Katti, Kartik Reddy
AU - Katti, Kartikeya Reddy
AU - Islam, Amanul
TI - Neural Turing Machines for efficient natural language summarization: architecture, optimization, and performance analysis
T2 - Frontiers in artificial intelligence
J2 - Front Artif Intell
PY - 2026
DA - 2026/08/31
VL - 9
SP - 1889866
SN - 2624-8212
PB - Frontiers Media SA
DO - 10.3389/frai.2026.1889866
UR - https://doi.org/10.3389/frai.2026.1889866
LA - en
ER -

CSL-JSON

{
"id": "10.3389/frai.2026.1889866",
"type": "article-journal",
"title": "Neural Turing Machines for efficient natural language summarization: architecture, optimization, and performance analysis",
"container-title": "Frontiers in artificial intelligence",
"author": [
{
"family": "Katti",
"given": "Kartik Reddy"
},
{
"family": "Katti",
"given": "Kartikeya Reddy"
},
{
"family": "Islam",
"given": "Amanul"
}
],
"container-title-short": "Front Artif Intell",
"volume": "9",
"page": "1889866",
"DOI": "10.3389/frai.2026.1889866",
"PMID": "42741109",
"PMCID": "PMC13572678",
"ISSN": "2624-8212",
"publisher": "Frontiers Media SA",
"URL": "https://doi.org/10.3389/frai.2026.1889866",
"language": "en",
"issued": {
"date-parts": [
[
2026,
8,
31
]
]
}
}

Similar papers

The papers with a page that share the most with this one: the tools found in their code, their categories, datasets, cited references and authors, the rarest counting most.

[1] doi:10.1016/j.scog.2026.100443 [code]
From thought to language: Comparing schizophrenia spectrum disorders and Wernicke's aphasia with machine learning and LLMs.
Journal: Schizophrenia research. Cognition
In common: cognitive, 1 reference
[2] doi:10.3389/frai.2026.1848216 [code]
A four-module neural architecture for the automatic extraction and classification of causal relations in text.
Journal: Frontiers in artificial intelligence
In common: 1 reference
[3] doi:10.1016/j.isci.2026.116135 [code]
Predicting ICU in-hospital mortality from text-encoded structured EHR data using adaptive transformer layer fusion.
Journal: iScience
In common: 1 reference

Contribute

The authors of this paper can claim it, correct its record and validate its tracing map, and the maintainers of its code (its owner, or a public member of its organization) correct what it says of their repository; anyone signed in can ask for its removal. Every request goes to OSCR's own machine, which answers it; your account page follows them.

Sign in with ORCID to claim this paper as one of its authors, correct its record or validate its tracing map: when the paper's metadata lists your ORCID iD, you are recognized at once. Maintainers of its code: sign in with GitHub, then claim the repository on your account page.

Request its removal

To ask OSCR to remove this record, the copies of its authors' scripts or its tracing map, use the removal request page: signed in, you say who you are, what to remove and why, then review and confirm the request. Published rules decide every request (how).

Discussion, reproductions, activity

Discussion: questions and error reports about this paper and its code, from signed-in readers and its authors. It opens with sign-in.

Reproductions: reports from readers who ran the authors' code: what they reproduced, with which environment, commit and data. It opens with sign-in.

Activity: what happens around this paper: new versions of its record, its map's validation, discussions and reproductions. It opens with sign-in.