Recurring spoken term discovery in the zero-resource constraint using diagonal patterns

Abstract Spoken term discovery (STD) is challenging when a large volume of spoken content is generated without annotations. Unsupervised approaches resolve this challenge by directly computing pattern matches from the acoustic feature representation of the speech signal. However, this approach produces a lot of false alarms due to inherent speech variabilities, leading to performance degradation in the STD task. To overcome these challenges and improve performance, we propose a two-stage approach. First, we identify an acoustic feature representation that emphasizes spoken content irrespective of the variability challenge. Second, we employ the proposed diagonal pattern search to capture spoken term matches in an unsupervised way without any transcriptions. The proposed approach validated using Microsoft Speech Corpus for Low-Resource languages reveals that an 18% gain in hit ratio and 37% reduction in the false alarm ratio was achieved compared with the state-of-the-art methods.

Authors

Institutions

Publication Details

Journal
Data-Centric Engineering
Published
2025-01-01
DOI
https://doi.org/10.1017/dce.2024.48
Primary Topic
Natural Language Processing Techniques
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Recurring spoken term discovery in the zero-resource constraint using diagonal patterns

Pabitra Mitra, Sreenivasa Rao K, Sudhakar Pandiarajan
Data-Centric Engineering
Natural Language Processing Techniques
article

Recurring spoken term discovery in the zero-resource constraint using diagonal patterns

Pabitra Mitra, Sreenivasa Rao K, Sudhakar Pandiarajan
article en

Abstract

Abstract Spoken term discovery (STD) is challenging when a large volume of spoken content is generated without annotations. Unsupervised approaches resolve this challenge by directly computing pattern matches from the acoustic feature representation of the speech signal. However, this approach produces a lot of false alarms due to inherent speech variabilities, leading to performance degradation in the STD task. To overcome these challenges and improve performance, we propose a two-stage approach. First, we identify an acoustic feature representation that emphasizes spoken content irrespective of the variability challenge. Second, we employ the proposed diagonal pattern search to capture spoken term matches in an unsupervised way without any transcriptions. The proposed approach validated using Microsoft Speech Corpus for Low-Resource languages reveals that an 18% gain in hit ratio and 37% reduction in the false alarm ratio was achieved compared with the state-of-the-art methods.

Data-Centric EngineeringVol. 6
Indian Institute of Technology Kharagpur (IN), Vellore Institute of Technology University (IN)
Openalex Percentile: Top 94%
Natural Language Processing Techniques
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.

Recurring spoken term discovery in the zero-resource constraint using diagonal patterns — Pabitra Mitra, Sreenivasa Rao K, et al. · Data-Centric Engineering (2025) | TGRS Research Map | TGRS