Karthik Ganesan, Pakhi Bamdev, Amresh Venugopal, Abhinav Tushar
We have not lifted any functions out of this paper's repositories yet, so there is nothing we have run. The repositories linked to it are listed below.
Some links come from the archived Papers with Code dataset (CC BY-SA 4.0): attribution and licence.
Spoken Language Understanding (SLU) systems parse speech into semantic structures like dialog acts and slots. This involves the use of an Automatic Speech Recognizer (ASR) to transcribe speech into multiple text alternatives (hypotheses). Transcription errors, common in ASRs, impact downstream SLU performance negatively. Approaches to mitigate such errors involve using richer information from the ASR, either in form of N-best hypotheses or word-lattices. We hypothesize that transformer models learn better with a simpler utterance representation using the concatenation of the N-best ASR alternatives, where each alternative is separated by a special delimiter [SEP]. In our work, we test our hypothesis by using concatenated N-best ASR alternatives as the input to transformer encoder models, namely BERT and XLM-RoBERTa, and achieve performance equivalent to the prior state-of-the-art model on DSTC2 dataset. We also show that our approach significantly outperforms the prior state-of-the-art when subjected to the low data regime. Additionally, this methodology is accessible to users of third-party ASR APIs which do not provide word-lattice information.
The same record, over MCP at https://syntology.ai/mcp:
get_harvested_code_for_paper("2106.06519")
get_code_for_paper("2106.06519")
have("2106.06519")
The run record, dated, one paper per request, free:
curl https://syntology.ai/api/ran/2106.06519.json
A badge for a README (the split and the date, never a ratio):
[](https://syntology.ai/paper/2106.06519)
Connect an agent — have() is free.