MURMUR: An Efficient Inference System for Long-Form ASR

Wei-Tzu Lee, Keisuke Kamahori, Baris Kasikci
5/31/2026
cs.LGcs.AIeess.AS

Official code: uw-syfi/Murmur (10 stars, MIT, last commit 2026-06-03).

Abstract

Long-form automatic speech recognition (ASR) requires both high accuracy and low latency, but existing systems force a trade-off between the two. Chunk-based pipelines process audio in parallel windows for low latency, but lose cross-chunk context and need brittle heuristics to align speakers and timestamps at boundaries. Long-context ASR models resolve everything in a single pass for better accuracy, but are an order of magnitude slower. We propose Murmur, an inference system that overcomes this trade-off by operating at two levels. At the inter-chunk level, we revisit the chunk-based pipeline for modern long-context ASR, treating chunk size as a tunable hyperparameter, and show that intermediate chunk sizes strike a good balance of accuracy and latency. At the intra-chunk level, we exploit attention sparsity through a sliding window KV cache eviction policy applied to both output and speech tokens. On AMI-IHM, Murmur matches single-pass accuracy while reducing latency by 4.2x, with further gains from token eviction at less than 1% relative tcpWER degradation. The code of Murmur is available at https://github.com/uw-syfi/Murmur.

View on arXivView PDF

Code Implementations(1)

uw-syfi/MurmurOfficial100%
MIT

Murmur: An Efficient Inference System for Long-Form ASR

102PythonMay 31, 20264 months agoMIT

Similar Papers

Cite this paper

@article{lee2026murmur,
  title  = {MURMUR: An Efficient Inference System for Long-Form ASR},
  author = {Wei-Tzu Lee and Keisuke Kamahori and Baris Kasikci},
  year   = {2026},
  eprint = {2606.01483},
  archivePrefix = {arXiv},
  url    = {http://arxiv.org/abs/2606.01483v1}
}

Add a badge to your README

Shows whether official code is linked for this paper.

Code of Paper badge
[![Code of Paper](https://codeofpaper.com/badge/2606.01483.svg)](https://codeofpaper.com/paper/2606.01483)

Discussion