aiqbench analysis
This research demonstrates an efficient method for localizing relevant segments within long transcripts by repurposing existing automatic speech recognition (ASR) encoder states, eliminating the need for separate audio processing. The approach yields consistent performance improvements over text-only baselines, particularly when dealing with structured or semi-structured speech data. By fusing these latent representations with textual embeddings, the study offers a lightweight solution to reduce computational costs in downstream natural language processing tasks.
Reusing Latent Speech Representations for Query-Conditioned Topic Localization in Transcripts
arXiv:2609.21844v1 Announce Type: new Abstract: Long transcripts are costly inputs for downstream NLP systems and often contain irrelevant context. We study query-conditioned topic localization: predicting the sentence span in a transcript that best addresses a topic-title query. To improve span localization, we reuse ASR encoder states as sentence-level representations and fuse them with textual embeddings. This lets lightweight span locators exploit speech information without running a separate audio encoder. Experiments on two public datasets show consistent gains over text-only baselines, especially under strict boundary-matching criteria. Cross-dataset experiments further indicate that the benefits are strongest for structured or semi-structured speech, while gains on spontaneous speech are limited and mixed.
Abstract:Long transcripts are costly inputs for downstream NLP systems and often contain irrelevant context. We study query-conditioned topic localization: predicting the sentence span in a transcript that best addresses a topic-title query. To improve span localization, we reuse ASR encoder states as sentence-level representations and fuse them with textual embeddings. This lets lightweight span locators exploit speech information without running a separate audio encoder. Experiments on two public datasets show consistent gains over text-only baselines, especially under strict boundary-matching criteria. Cross-dataset experiments further indicate that the benefits are strongest for structured or semi-structured speech, while gains on spontaneous speech are limited and mixed.
Computation and Language (cs.CL); Audio and Speech Processing (eess.AS)
arXiv:2609.21844 [cs.CL]
(or arXiv:2609.21844v1 [cs.CL] for this version)
https://doi.org/10.48550/arXiv.2609.21844 Focus to learn more arXiv-issued DOI via DataCite (pending registration)
arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website.
Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them.
Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs.
Full text under the publisher's open licence · 203 words
Related coverage

[AINews] not much happened today
Latent Space · Sep 10, 2026

[AINews] Here are 6 Clones of Jev in 2 days
Latent Space · Sep 19, 2026
Lngram v2: Latent N-Gram Memory with Interpretable Discrete Representations
arXiv · Sep 4, 2026
Triton-Based Optimization of Video Sparse Attention on ROCm
AMD · Jul 13, 2026