Improving Streaming End-to-End ASR on Transformer-based Causal Models with Encoder States Revision Strategies

There is often a trade-off between performance and latency in streaming automatic speech recognition (ASR). Traditional methods such as look-ahead and chunk-based methods, usually require information from future frames to advance recognition accuracy, which incurs inevitable latency even if the comp...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Hauptverfasser: Li, Zehan, Miao, Haoran, Deng, Keqi, Cheng, Gaofeng, Tian, Sanli, Li, Ta, Yan, Yonghong
Format: Artikel
Sprache:eng
Schlagworte:
Online-Zugang:Volltext bestellen
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
container_end_page
container_issue
container_start_page
container_title
container_volume
creator Li, Zehan
Miao, Haoran
Deng, Keqi
Cheng, Gaofeng
Tian, Sanli
Li, Ta
Yan, Yonghong
description There is often a trade-off between performance and latency in streaming automatic speech recognition (ASR). Traditional methods such as look-ahead and chunk-based methods, usually require information from future frames to advance recognition accuracy, which incurs inevitable latency even if the computation is fast enough. A causal model that computes without any future frames can avoid this latency, but its performance is significantly worse than traditional methods. In this paper, we propose corresponding revision strategies to improve the causal model. Firstly, we introduce a real-time encoder states revision strategy to modify previous states. Encoder forward computation starts once the data is received and revises the previous encoder states after several frames, which is no need to wait for any right context. Furthermore, a CTC spike position alignment decoding algorithm is designed to reduce time costs brought by the revision strategy. Experiments are all conducted on Librispeech datasets. Fine-tuning on the CTC-based wav2vec2.0 model, our best method can achieve 3.7/9.2 WERs on test-clean/other sets, which is also competitive with the chunk-based methods and the knowledge distillation methods.
doi_str_mv 10.48550/arxiv.2207.02495
format Article
fullrecord <record><control><sourceid>arxiv_GOX</sourceid><recordid>TN_cdi_arxiv_primary_2207_02495</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>2207_02495</sourcerecordid><originalsourceid>FETCH-LOGICAL-a675-104e3b382164319f3f3cbfabca7faaf265a886d131a2672b91feb4c7dee3b11a3</originalsourceid><addsrcrecordid>eNotj8tOwzAQRb1hgQofwKr-AQc_8lxWUYFKRUht9tE4GbeWkriyQ4C_xy2s7syVzpUOIU-CJ2mZZfwZ_LddEil5kXCZVtk9GXfjxbvFTid6nD3CeL22U89mx2LQzfFA3UQbD1Mwzo_omYaAPa3hM8BA312PQ6Bfdj5HrIufj0MwY6AHXGywEY7DsThZDA_kzsAQ8PE_V6R52Tb1G9t_vO7qzZ5BXmRM8BSVVqUUeapEZZRRnTagOygMgJF5BmWZ90IJkHkhdSUM6rQreoyYEKBWZP03e_NtL96O4H_aq3d781a_eC5Ugw</addsrcrecordid><sourcetype>Open Access Repository</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype></control><display><type>article</type><title>Improving Streaming End-to-End ASR on Transformer-based Causal Models with Encoder States Revision Strategies</title><source>arXiv.org</source><creator>Li, Zehan ; Miao, Haoran ; Deng, Keqi ; Cheng, Gaofeng ; Tian, Sanli ; Li, Ta ; Yan, Yonghong</creator><creatorcontrib>Li, Zehan ; Miao, Haoran ; Deng, Keqi ; Cheng, Gaofeng ; Tian, Sanli ; Li, Ta ; Yan, Yonghong</creatorcontrib><description>There is often a trade-off between performance and latency in streaming automatic speech recognition (ASR). Traditional methods such as look-ahead and chunk-based methods, usually require information from future frames to advance recognition accuracy, which incurs inevitable latency even if the computation is fast enough. A causal model that computes without any future frames can avoid this latency, but its performance is significantly worse than traditional methods. In this paper, we propose corresponding revision strategies to improve the causal model. Firstly, we introduce a real-time encoder states revision strategy to modify previous states. Encoder forward computation starts once the data is received and revises the previous encoder states after several frames, which is no need to wait for any right context. Furthermore, a CTC spike position alignment decoding algorithm is designed to reduce time costs brought by the revision strategy. Experiments are all conducted on Librispeech datasets. Fine-tuning on the CTC-based wav2vec2.0 model, our best method can achieve 3.7/9.2 WERs on test-clean/other sets, which is also competitive with the chunk-based methods and the knowledge distillation methods.</description><identifier>DOI: 10.48550/arxiv.2207.02495</identifier><language>eng</language><subject>Computer Science - Sound</subject><creationdate>2022-07</creationdate><rights>http://arxiv.org/licenses/nonexclusive-distrib/1.0</rights><oa>free_for_read</oa><woscitedreferencessubscribed>false</woscitedreferencessubscribed></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><link.rule.ids>228,230,776,881</link.rule.ids><linktorsrc>$$Uhttps://arxiv.org/abs/2207.02495$$EView_record_in_Cornell_University$$FView_record_in_$$GCornell_University$$Hfree_for_read</linktorsrc><backlink>$$Uhttps://doi.org/10.48550/arXiv.2207.02495$$DView paper in arXiv$$Hfree_for_read</backlink></links><search><creatorcontrib>Li, Zehan</creatorcontrib><creatorcontrib>Miao, Haoran</creatorcontrib><creatorcontrib>Deng, Keqi</creatorcontrib><creatorcontrib>Cheng, Gaofeng</creatorcontrib><creatorcontrib>Tian, Sanli</creatorcontrib><creatorcontrib>Li, Ta</creatorcontrib><creatorcontrib>Yan, Yonghong</creatorcontrib><title>Improving Streaming End-to-End ASR on Transformer-based Causal Models with Encoder States Revision Strategies</title><description>There is often a trade-off between performance and latency in streaming automatic speech recognition (ASR). Traditional methods such as look-ahead and chunk-based methods, usually require information from future frames to advance recognition accuracy, which incurs inevitable latency even if the computation is fast enough. A causal model that computes without any future frames can avoid this latency, but its performance is significantly worse than traditional methods. In this paper, we propose corresponding revision strategies to improve the causal model. Firstly, we introduce a real-time encoder states revision strategy to modify previous states. Encoder forward computation starts once the data is received and revises the previous encoder states after several frames, which is no need to wait for any right context. Furthermore, a CTC spike position alignment decoding algorithm is designed to reduce time costs brought by the revision strategy. Experiments are all conducted on Librispeech datasets. Fine-tuning on the CTC-based wav2vec2.0 model, our best method can achieve 3.7/9.2 WERs on test-clean/other sets, which is also competitive with the chunk-based methods and the knowledge distillation methods.</description><subject>Computer Science - Sound</subject><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2022</creationdate><recordtype>article</recordtype><sourceid>GOX</sourceid><recordid>eNotj8tOwzAQRb1hgQofwKr-AQc_8lxWUYFKRUht9tE4GbeWkriyQ4C_xy2s7syVzpUOIU-CJ2mZZfwZ_LddEil5kXCZVtk9GXfjxbvFTid6nD3CeL22U89mx2LQzfFA3UQbD1Mwzo_omYaAPa3hM8BA312PQ6Bfdj5HrIufj0MwY6AHXGywEY7DsThZDA_kzsAQ8PE_V6R52Tb1G9t_vO7qzZ5BXmRM8BSVVqUUeapEZZRRnTagOygMgJF5BmWZ90IJkHkhdSUM6rQreoyYEKBWZP03e_NtL96O4H_aq3d781a_eC5Ugw</recordid><startdate>20220706</startdate><enddate>20220706</enddate><creator>Li, Zehan</creator><creator>Miao, Haoran</creator><creator>Deng, Keqi</creator><creator>Cheng, Gaofeng</creator><creator>Tian, Sanli</creator><creator>Li, Ta</creator><creator>Yan, Yonghong</creator><scope>AKY</scope><scope>GOX</scope></search><sort><creationdate>20220706</creationdate><title>Improving Streaming End-to-End ASR on Transformer-based Causal Models with Encoder States Revision Strategies</title><author>Li, Zehan ; Miao, Haoran ; Deng, Keqi ; Cheng, Gaofeng ; Tian, Sanli ; Li, Ta ; Yan, Yonghong</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-a675-104e3b382164319f3f3cbfabca7faaf265a886d131a2672b91feb4c7dee3b11a3</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2022</creationdate><topic>Computer Science - Sound</topic><toplevel>online_resources</toplevel><creatorcontrib>Li, Zehan</creatorcontrib><creatorcontrib>Miao, Haoran</creatorcontrib><creatorcontrib>Deng, Keqi</creatorcontrib><creatorcontrib>Cheng, Gaofeng</creatorcontrib><creatorcontrib>Tian, Sanli</creatorcontrib><creatorcontrib>Li, Ta</creatorcontrib><creatorcontrib>Yan, Yonghong</creatorcontrib><collection>arXiv Computer Science</collection><collection>arXiv.org</collection></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext_linktorsrc</fulltext></delivery><addata><au>Li, Zehan</au><au>Miao, Haoran</au><au>Deng, Keqi</au><au>Cheng, Gaofeng</au><au>Tian, Sanli</au><au>Li, Ta</au><au>Yan, Yonghong</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>Improving Streaming End-to-End ASR on Transformer-based Causal Models with Encoder States Revision Strategies</atitle><date>2022-07-06</date><risdate>2022</risdate><abstract>There is often a trade-off between performance and latency in streaming automatic speech recognition (ASR). Traditional methods such as look-ahead and chunk-based methods, usually require information from future frames to advance recognition accuracy, which incurs inevitable latency even if the computation is fast enough. A causal model that computes without any future frames can avoid this latency, but its performance is significantly worse than traditional methods. In this paper, we propose corresponding revision strategies to improve the causal model. Firstly, we introduce a real-time encoder states revision strategy to modify previous states. Encoder forward computation starts once the data is received and revises the previous encoder states after several frames, which is no need to wait for any right context. Furthermore, a CTC spike position alignment decoding algorithm is designed to reduce time costs brought by the revision strategy. Experiments are all conducted on Librispeech datasets. Fine-tuning on the CTC-based wav2vec2.0 model, our best method can achieve 3.7/9.2 WERs on test-clean/other sets, which is also competitive with the chunk-based methods and the knowledge distillation methods.</abstract><doi>10.48550/arxiv.2207.02495</doi><oa>free_for_read</oa></addata></record>
fulltext fulltext_linktorsrc
identifier DOI: 10.48550/arxiv.2207.02495
ispartof
issn
language eng
recordid cdi_arxiv_primary_2207_02495
source arXiv.org
subjects Computer Science - Sound
title Improving Streaming End-to-End ASR on Transformer-based Causal Models with Encoder States Revision Strategies
url https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-02-21T13%3A15%3A08IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-arxiv_GOX&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=Improving%20Streaming%20End-to-End%20ASR%20on%20Transformer-based%20Causal%20Models%20with%20Encoder%20States%20Revision%20Strategies&rft.au=Li,%20Zehan&rft.date=2022-07-06&rft_id=info:doi/10.48550/arxiv.2207.02495&rft_dat=%3Carxiv_GOX%3E2207_02495%3C/arxiv_GOX%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_id=info:pmid/&rfr_iscdi=true