Methods › General › Attention Mechanisms › Content-based Attention
Content-based Attention
Introduced by Alex Graves et al. in Neural Turing Machines
archive 2025-07-28 Description, source and code snippet are the archive's method entry.
Content-based attention is an attention mechanism based on cosine similarity:
fₐₜₜ(hᵢ, sⱼ) = cos[hᵢ;sⱼ]
It was utilised in Neural Turing Machines as part of the Addressing Mechanism.
We produce a normalized attention weighting by taking a softmax over these attention alignment scores.
In Syntology name not resolved (unknown_name). The lookup matched no method, paper or venue by this name; that asserts nothing about whether code exists.
Near matches the lookup lists, each a different name: Parameter-free Adaptive Sparse Attention via Compression-Based Content Selection; TC-ATTENTION; TF-ATTENTION; EL-Attention; SS-Attention; VC-Attention; Attention-IoU; DFC attention.
Syntology's have check for this name (free, it answers coverage only), read 2026-10-05; ask it again live. A level is the served verification level of that one answer; nothing here is summed across methods.
Papers archive 2025-07-28
archive papers tagged: 33 · with a code link: 10 · where Syntology ran a sample: 1 (1 with a run with no instrument failure, 0 where every run was a failure of Syntology's instrument) Syntology
Show: all tagged papersonly where code ran (1 of 33 tagged: 1 with a run with no instrument failure, 0 where every run was a failure of Syntology's instrument)
Page 1 of 1: papers 1 to 33 of 33, newest first by the archive's date (ties by slug), in archive order.
Repository counts are the archive's code-links table. A Syntology line states what Syntology ran from that paper's harvested code, as “N ran (of which C constructed an object rather than computing a result; K with no instrument failure: H honoured, V violated, P with no contract checked; I where Syntology's instrument failed) · U unverified”; the instrument figure counts failures of Syntology's instrument, not of the code. It is per sample and not a correctness claim. When the archive marks a repository official for the paper, the line starts with that repository's state (the archive's flag, not a verdict on who wrote the code; “community repositories only” when every sample that ran came from a community repository, “official: no sample here; runs from other or unrecorded repositories” when some came from a repository the paper names or has in its text, or from none recorded); hover it for the repositories the samples that ran came from.
-
Intelligent DoS and DDoS Detection: A Hybrid GRU-NTM Approach to Network Security 10 Apr 2025 · 0 repositories · arXiv:2504.07478
-
Memory-augmented conformer for improved end-to-end long-form ASR 22 Sep 2023 · 1 repository · arXiv:2309.13029
-
FashionNTM: Multi-turn Fashion Image Retrieval via Cascaded Memory 20 Aug 2023 · 0 repositories · arXiv:2308.10170
-
TPS++: Attention-Enhanced Thin-Plate Spline for Scene Text Recognition 9 May 2023 · 1 repository · arXiv:2305.05322
-
Token Turing Machines 16 Nov 2022 · 1 repository · arXiv:2211.09119
-
Similarity and Content-based Phonetic Self Attention for Speech Recognition 19 Mar 2022 · 0 repositories · arXiv:2203.10252
-
HiMA: A Fast and Scalable History-based Memory Access Engine for Differentiable Neural Computer 15 Feb 2022 · 0 repositories · arXiv:2202.07275
-
AttentionHTR: Handwritten Text Recognition Based on Attention Encoder-Decoder Networks 23 Jan 2022 · 1 repository · arXiv:2201.09390
-
Hard-Attention for Scalable Image Classification 20 Feb 2021 · 1 repository · arXiv:2102.10212
-
Robust High-dimensional Memory-augmented Neural Networks 5 Oct 2020 · 0 repositories · arXiv:2010.01939
-
Explainable Inference on Sequential Data via Memory-Tracking 11 Jul 2020 · 1 repository
-
Unsupervised Speaker Adaptation using Attention-based Speaker Memory for End-to-End ASR 14 Feb 2020 · 0 repositories · arXiv:2002.06165
-
Sequence-to-sequence Singing Synthesis Using the Feed-forward Transformer 22 Oct 2019 · 0 repositories · arXiv:1910.09989
-
Memory-Augmented Recurrent Networks for Dialogue Coherence 16 Oct 2019 · 0 repositories · arXiv:1910.10487
-
A Neural Turing Machine for Conditional Transition Graph Modeling 15 Jul 2019 · 0 repositories · arXiv:1907.06432
-
Understanding Memory Modules on Learning Simple Algorithms 1 Jul 2019 · 0 repositories · arXiv:1907.00820
-
A review on Neural Turing Machine 10 Apr 2019 · 0 repositories · arXiv:1904.05061
-
Few-Shot Generalization Across Dialogue Tasks 28 Nov 2018 · 2 repositories · arXiv:1811.11707
-
Context-Aware Neural Model for Temporal Information Extraction 1 Jul 2018 · 0 repositories
-
A Taxonomy for Neural Memory Networks 1 May 2018 · 0 repositories · arXiv:1805.00327
-
The Set Autoencoder: Unsupervised Representation Learning for Sets 1 Jan 2018 · 0 repositories
-
Meta-Learning via Feature-Label Memory Network 19 Oct 2017 · 0 repositories · arXiv:1710.07110
-
Efficient Attention using a Fixed-Size Memory Representation 1 Jul 2017 · 0 repositories · arXiv:1707.00110
-
Attention-Set based Metric Learning for Video Face Recognition 12 Apr 2017 · 0 repositories · arXiv:1704.03805
-
Tracking the World State with Recurrent Entity Networks 12 Dec 2016 · 5 repositories · arXiv:1612.03969Syntology official: not harvested · 0 ran · 3 unverified (of 3 harvested samples)
-
Neural Turing Machines: Convergence of Copy Tasks 7 Dec 2016 · 0 repositories · arXiv:1612.02336
-
A Cheap Linear Attention Mechanism with Fast Lookups and Fixed-Size Representations 19 Sep 2016 · 0 repositories · arXiv:1609.05866
-
Dynamic Neural Turing Machine with Soft and Hard Addressing Schemes 30 Jun 2016 · 0 repositories · arXiv:1607.00036
-
Lie Access Neural Turing Machine 28 Feb 2016 · 0 repositories · arXiv:1602.08671
-
Empirical Study on Deep Learning Models for Question Answering 26 Oct 2015 · 0 repositories · arXiv:1510.07526
-
A Deep Memory-based Architecture for Sequence-to-Sequence Learning 22 Jun 2015 · 0 repositories · arXiv:1506.06442
-
Reinforcement Learning Neural Turing Machines - Revised 4 May 2015 · 1 repository · arXiv:1505.00521
-
Neural Turing Machines 20 Oct 2014 · 34 repositories · arXiv:1410.5401Syntology 5 ran (of which 0 constructed an object rather than computing a result; 4 with no instrument failure: 1 honoured, 2 violated, 1 with no contract checked; 1 where Syntology's instrument failed) · 3 unverified (of 8 harvested samples) · 2 pointer-only (licence)
Tasks archive 2025-07-28
20 shown of 51 tasks the archive attaches to papers tagged with this method, by distinct papers. A task without a page in the catalog is plain text.
Usage over time archive 2025-07-28
Components: the archive holds no method-to-method composition, so PwC's Components table cannot be rebuilt; the Papers list carries no Results column for the same reason (the archive does not join its leaderboard rows to method tags).
Categories archive 2025-07-28
Report a problem or propose a change · a person checks every report against the paper or source before anything changes; decisions are listed on /corrections