AI summary · arXiv: 2211.09235v1 · cs.CL

Artificial Disfluency Detection, Uh No, Disfluency Generation for the Masses

T. Passali, T. Mavropoulos, G. Tsoumakas, G. Meditskos, S. Vrochidis
Original paper Submitted to arXiv on 16 Nov. 2022 10 pages License: NONEXCLUSIVE-DISTRIB 1.0

How to read this summary? Illustrated guide

The essentials

  • The paper proposes a new method called LARD for generating artificial disfluencies from fluent text.
  • Existing approaches for disfluency detection require large annotated datasets which are limited and suffer from class imbalance.
  • LARD can simulate all types of disfluencies such as repetitions, replacements, and restarts based on the reparandum/interregnum annotation scheme.
  • LARD incorporates contextual embeddings into the generation process to produce realistic context-aware artificial disfluencies.
  • LARD requires only fluent text and can be used directly for training without any annotated disfluent data.
  • The empirical evaluation demonstrates that LARD can effectively generate realistic disfluencies even when no or only a few data are available.
  • The proposed method increases the accuracy of existing disfluency detectors.
  • The approach has several practical applications in natural language processing (NLP) tasks such as automatic speech recognition (ASR), spoken dialogue systems, and machine translation.
  • The method could be used to augment existing datasets with additional synthetic examples to improve performance further.

Key points written by AI: they may contain errors, check them against the paper.

AI-generated keywords: Artificial Disfluency LARD Reparandum/Interregnum Annotation Scheme Contextual Embeddings NLP Applications

Read further

  • Comprehensive Summary
  • Layman's Summary
  • Blog article
  • Original abstract
The paper titled "Artificial Disfluency Detection, Uh No, Disfluency Generation for the Masses" proposes a novel method called LARD for generating artificial disfluencies from fluent text. The existing approaches for disfluency detection require large annotated datasets which are limited and suffer from class imbalance. Moreover, they lack some types of disfluencies that can be encountered in real-world scenarios. LARD can simulate all types of disfluencies such as repetitions, replacements, and restarts based on the reparandum/interregnum annotation scheme. It also incorporates contextual embeddings into the generation process to produce realistic context-aware artificial disfluencies. One of the significant advantages of LARD is that it requires only fluent text and can be used directly for training without any annotated disfluent data. The empirical evaluation demonstrates that LARD can effectively generate realistic disfluencies even when no or only a few data are available. Furthermore, the proposed method increases the accuracy of existing disfluency detectors. The authors argue that their approach has several practical applications in natural language processing (NLP) tasks such as automatic speech recognition (ASR), spoken dialogue systems, and machine translation. They also suggest that their method could be used to augment existing datasets with additional synthetic examples to improve performance further. Overall, this paper presents an innovative solution to address the limitations of current approaches for detecting disfluencies by proposing a new method for generating artificial ones. The proposed approach shows promising results and has potential implications in various NLP applications.

Was this synthesis useful?

Score: 0

Why do we need votes?

Votes are used to determine whether we need to re-run our summarizing tools. If the count reaches -10, our tools can be restarted.

Ask questions about this paper to our AI assistant

How to chat with this paper? Illustrated guide

Compare with the PDF

You can also chat with multiple papers at once here.

⚠The license of the paper does not allow us to build upon its content and the AI assistant only knows about the paper metadata rather than the full article.

Figures and plots

Ask about a figure by number or use its question button to request visual analysis. Up to two figures and four image panels per question. Values read from plots are approximate; check the original data.

AI assistant instructions?

Tools for this paper

Explain it differently 3 free rewrites left today
Save to a collection Group papers in collections to compare them, chat with them and export them. Create a free account Log in

Advanced tools Premium

For researchers who follow a field closely: citation alerts, journal-club slides, version comparison and Zotero export. Discover Premium

Zotero
Citation alerts Citation alerts guide
Journal club Premium+ Slides to present it

Papers around this one

See them on a map

Ranked by how close their title and abstract are to this paper’s. Select some to read them together.

Closest papers

  1. Related
    Active Retrieval Augmented Generation
    Zhengbao Jiang, Frank F. Xu, Luyu Gao et al. · 2023 · Computation and Language · AI summary available
    Abstract

    Despite the remarkable ability of large language models (LMs) to comprehend and generate language, they have a tendency to hallucinate and create factually inaccurate output. Augmenting LMs by retrieving information from external knowledge resources is one promising solution. Most existing retrieval-augmented LMs employ a retrieve-and-generate setup that only retrieves information once based on the input. This is limiting, however, in more general scenarios involving generation of long texts, where continually gathering information throughout the generation process is essential. There have been some past efforts to retrieve information multiple times while generating outputs, which mostly re…

  2. Related
    A Survey on LLM-generated Text Detection: Necessity, Methods, and Future Directions
    Junchao Wu, Shu Yang, Runzhe Zhan et al. · 2023 · Computation and Language · AI summary available
    Abstract

    The powerful ability to understand, follow, and generate complex language emerging from large language models (LLMs) makes LLM-generated text flood many areas of our daily lives at an incredible speed and is widely accepted by humans. As LLMs continue to expand, there is an imperative need to develop detectors that can detect LLM-generated text. This is crucial to mitigate potential misuse of LLMs and safeguard realms like artistic expression and social networks from harmful influence of LLM-generated content. The LLM-generated text detection aims to discern if a piece of text was produced by an LLM, which is essentially a binary classification task. The detector techniques have witnessed no…

  3. Related
    APAR: LLMs Can Do Auto-Parallel Auto-Regressive Decoding
    Mingdao Liu, Aohan Zeng, Bowen Wang et al. · 2024 · Computation and Language · AI summary available
    Abstract

    The massive adoption of large language models (LLMs) demands efficient deployment strategies. However, the auto-regressive decoding process, which is fundamental to how most LLMs generate text, poses challenges to achieve efficient serving. In this work, we introduce a parallel auto-regressive generation method. By instruct-tuning on general domain data that contains hierarchical structures, we enable LLMs to independently plan their generation process and perform auto-parallel auto-regressive (APAR) generation, significantly reducing the number of generation steps. APAR alone can achieve up to 2x speed-up, and when combined with speculative decoding, the speed-up can reach up to 4x. In addi…

  4. Related
    Filler Word Detection and Classification: A Dataset and Benchmark
    Ge Zhu, Juan-Pablo Caceres, Justin Salamon · 2022 · Computation and Language · AI summary available
    Abstract

    Filler words such as `uh' or `um' are sounds or words people use to signal they are pausing to think. Finding and removing filler words from recordings is a common and tedious task in media editing. Automatically detecting and classifying filler words could greatly aid in this task, but few studies have been published on this problem. A key reason is the absence of a dataset with annotated filler words for training and evaluation. In this work, we present a novel speech dataset, PodcastFillers, with 35K annotated filler words and 50K annotations of other sounds that commonly occur in podcasts such as breaths, laughter, and word repetitions. We propose a pipeline that leverages VAD and ASR to…

  5. Related
    DiffuCoder: Understanding and Improving Masked Diffusion Models for Code Generation
    Shansan Gong, Ruixiang Zhang, Huangjie Zheng et al. · 2025 · Computation and Language · AI summary available
    Abstract

    Diffusion large language models (dLLMs) are compelling alternatives to autoregressive (AR) models because their denoising models operate over the entire sequence. The global planning and iterative refinement features of dLLMs are particularly useful for code generation. However, current training and inference mechanisms for dLLMs in coding are still under-explored. To demystify the decoding behavior of dLLMs and unlock their potential for coding, we systematically investigate their denoising processes and reinforcement learning (RL) methods. We train a 7B dLLM, \textbf{DiffuCoder}, on 130B tokens of code. Using this model as a testbed, we analyze its decoding behavior, revealing how it diffe…

  6. Related
    RAG-DDR: Optimizing Retrieval-Augmented Generation Using Differentiable Data Rewards
    Xinze Li, Sen Mei, Zhenghao Liu et al. · 2024 · Computation and Language · AI summary available
    Abstract

    Retrieval-Augmented Generation (RAG) has proven its effectiveness in mitigating hallucinations in Large Language Models (LLMs) by retrieving knowledge from external resources. To adapt LLMs for RAG pipelines, current approaches use instruction tuning to optimize LLMs, improving their ability to utilize retrieved knowledge. This supervised fine-tuning (SFT) approach focuses on equipping LLMs to handle diverse RAG tasks using different instructions. However, it trains RAG modules to overfit training signals and overlooks the varying data preferences among agents within the RAG system. In this paper, we propose a Differentiable Data Rewards (DDR) method, which end-to-end trains RAG systems by a…

  7. Related
    RAGTruth: A Hallucination Corpus for Developing Trustworthy Retrieval-Augmented Language Models
    Yuanhao Wu, Juno Zhu, Siliang Xu et al. · 2023 · Computation and Language · Not summarized yet
    Abstract

    Retrieval-augmented generation (RAG) has become a main technique for alleviating hallucinations in large language models (LLMs). Despite the integration of RAG, LLMs may still present unsupported or contradictory claims to the retrieved contents. In order to develop effective hallucination prevention strategies under RAG, it is important to create benchmark datasets that can measure the extent of hallucination. This paper presents RAGTruth, a corpus tailored for analyzing word-level hallucinations in various domains and tasks within the standard RAG frameworks for LLM applications. RAGTruth comprises nearly 18,000 naturally generated responses from diverse LLMs using RAG. These responses hav…

  8. Related
    DataDreamer: A Tool for Synthetic Data Generation and Reproducible LLM Workflows
    Ajay Patel, Colin Raffel, Chris Callison-Burch · 2024 · Computation and Language · AI summary available
    Abstract

    Large language models (LLMs) have become a dominant and important tool for NLP researchers in a wide range of tasks. Today, many researchers use LLMs in synthetic data generation, task evaluation, fine-tuning, distillation, and other model-in-the-loop research workflows. However, challenges arise when using these models that stem from their scale, their closed source nature, and the lack of standardized tooling for these new and emerging workflows. The rapid rise to prominence of these models and these unique challenges has had immediate adverse impacts on open science and on the reproducibility of work that uses them. In this paper, we introduce DataDreamer, an open source Python library th…

How are these papers found?

We compare the title and abstract of this paper with those of every paper summarized on this site, and with the papers Semantic Scholar recommends, those it cites and those citing it (for a much-cited paper, its most recent citations and, from OpenAlex, the most cited ones). Among the prior work and the follow-ups, the papers that use each other in depth, a method it uses and the much-cited follow-ups come a little higher. The levels (very close, close, related) come from the similarity of the texts, not from a judgment of quality; * marks a paper without an abstract, compared by its title. The sentence under a paper is written by an AI from the two abstracts: check it in the papers. A paper marked not relevant by three readers leaves the list.

For now only among the papers summarized on this site: search again to add the prior work, the follow-ups and Semantic Scholar’s recommendations.

The previous summary was created more than a year ago and can be re-run (if necessary) by clicking on the Run button below.

⚠The license of this specific paper does not allow us to build upon its content and the summarizing tools will be run using the paper metadata rather than the full article. However, it still does a good job, and you can also try our tools on papers with more open licenses.

Disclaimer: The AI-based summarization tool and virtual assistant provided on this website may not always provide accurate and complete summaries or responses. We encourage you to carefully review and evaluate the generated content to ensure its quality and relevance to your needs.