Elamur Research⌕
☰
home / papers / 2009 / Disfluency and Out-of-vocabulary Word Processing in Arabic Speech Understanding

Disfluency and Out-of-vocabulary Word Processing in Arabic Speech Understanding

Paper · 2009 · Younès Bahou, Lamia Hadrich Belguith and Abdelmajid Ben Hamadou

Summary

The paper addresses spoken Modern Standard Arabic in a narrow-domain dialogue system. Automatic transcripts of spontaneous requests often contain hesitations, repeated or self-corrected phrases, and broken words. They also contain out-of-vocabulary (OOV) tokens: words the recognizer got wrong, words missing from the lexicon, or words only partly recognized. The authors build a robust, partial-analysis pipeline for SARF, a voice server for Tunisian railway information.

The pipeline has three steps:

  • A semantically tagged utterance is cut into conceptual segments: illocutionary, referential and filler segments, plus a special Disfluent segment.
  • Disfluent segments are repaired with reparandum/editing-term/alteration patterns.
  • Words that do not fit the word class expected by their segment are flagged as OOV and reassigned or corrected.

On a Wizard-of-Oz evaluation corpus, the module reduced semantic-frame filling failures from 18.54% to 12.63%. This shows that shallow, meaning-driven repair can make a speech understanding system much more tolerant of noisy input, even for an under-resourced language.

Key points

  • In the study corpus, 25.24% of utterances contained disfluencies and 38.22% contained OOV words.

  • The evaluation corpus has 2823 spontaneous, automatically transcribed requests (34,726 words): 1291 of type A, 1434 of type D and 98 of type X.

  • Detection and correction rates:

    Correctly detectedWell corrected
    OOV words78.04%87.36%
    Disfluencies61.29%81.07%
  • Overall results were recall 79.23%, precision 74.09% and F-Measure 76.57%. Processing a 12-word utterance took about 0.394 s on average.

  • The module is implemented in Java (JBuilder 2007) and outputs semantic frames as XML for the dialogue manager.

  • Most errors trace back to wrong conceptual segmentation. Complex disfluencies that mix repetition and self-correction remain unhandled.

Interesting ideas

  • I1. A word can be in the lexicon and still be misrecognized: the system catches this when the word's class clashes with the type the slot expects (a month name where a destination city should be). Type expectations thus act as an error detector, not just a filter.
  • I2. A repair is written as reparandum, optional editing term, interruption point and alteration, with each pair of words labelled as identical, same-role substitute, or neutral insertion. Only the alteration is kept, and the cleaned segment is then re-classified from scratch.
  • I3. Suspected disfluencies are first quarantined in a dedicated Disfluent segment, so later stages handle them explicitly instead of letting them corrupt ordinary analysis.
  • I4. A generic Number tag is refined into specific readings such as Fare, Hour or Minute using its position and neighbouring words.
  • I5. When an OOV word sits equally close to two candidates, the system declines to guess and hands the ambiguity to the dialogue manager. Detection and correction are also scored separately.

For Mova

How these ideas could serve Mova, our small open language model — its files, stages and tests:

  • I1 (frames): VerbNet selectional restrictions on roles could flag fillers whose type clashes with the role, marking a likely tagging or parse error instead of silently accepting it.
  • I2 (tokens): a small explainable pattern layer could strip self-corrections such as "to Boston, uh, no, to Denver" from transcribed or chat-style English before tagging, and log which pattern fired.
  • I3 (tree): material that is probably broken could be wrapped as a flagged span for the parser, giving traceable treatment rather than spurious dependency arcs.
  • I4 (world): bare numerals could be typed into measures, values or times from local context before entering the world model, which helps maths word problems.
  • I5 (answer): readers could abstain or name the competing candidates when evidence ties, and evaluation could report "found the problem" and "fixed it" as separate numbers.

Our summary of the paper, in our own words — not its text. The work belongs to its authors; read it at the links above.

 Fields, topics and concepts

📚 Shelves 4The field of science this work belongs to (OpenAlex fields).Computer Science · 9,085 worksArtificial Intelligence · 8,888 worksArts and Humanities · 9,296 worksLanguage and Linguistics · 9,206 works

🧭 Topics 1Research subjects and languages the work is about.Semitic languages · 1,485 works

Cite

Cite as Younès Bahou, Lamia Hadrich Belguith and Abdelmajid Ben Hamadou. 2009. Disfluency and Out-of-vocabulary Word Processing in Arabic Speech Understanding. Proceedings of the Third Workshop on Computational Approaches to Arabic-Script-based Languages (CAASL3).

The paper itself, not this page. BibTeX from the library's record of the work.

@inproceedings{bahou2009disfluency,
  title = {{Disfluency and Out-of-vocabulary Word Processing in Arabic Speech Understanding}},
  author = {Younès Bahou, Lamia Hadrich Belguith and Abdelmajid Ben Hamadou},
  booktitle = {Proceedings of the Third Workshop on Computational Approaches to Arabic-Script-based Languages (CAASL3)},
  year = {2009},
  url = {https://aclanthology.org/2009.mtsummit-caasl.3/}
}

References

11 references, 0 of them with a card of ours. ↗ leads to the work, «find» searches for one we have no id for yet.

  1. Bazzi I. and Glass J. 2001. Learning Units for Domain-Independent Out-Of-Vocabulary Words Modeling. European Conference on Speech Communication and Technology, pp. 61–64. Aalborg, Denmark. segment. Note that, for the example (9), our understanding module did not generate an error in filling semantic frame because it retains the last value of semantic cases. find
  2. Bear J., Dowding J. and Shriberg E. 1992. Integrating Multiple Knowledge Sources for Detection and Correction of Repairs in Human-Computer Dialog. In Proceedings of the 30th Annual Meeting of the Association for Computational Linguistics, Newark, Deleware, USA. find
  3. Bousquet-Vernhettes C. 2002. Compréhension Robuste de la Parole Spontanée dans le Dialogue Oral Homme-Machine – Décodage Conceptuel Stochastique. PHD Thesis, University of Toulouse III–Paul SABATIER, France. find
  4. Bove R. 2008. A Tagged Corpus-Based Study for Repeats and Self-Repairs Detection in French Transcribed Speech. Proceedings of the 11th International Conference on Text, Speech and Dialogue, pp. 269–276. Brno, Czech Republic. find
  5. Bruce B. 1975. Cases Systems for Natural Languages. Artificial Intelligence, vol. 6, pp. 327—360. find
  6. Core M. and Schubert L. 1999. A Model of Speech Repairs and Other Disruptions. Presented at AAAI Fall Symposium on Psychological Models of Communication in Collaborative Systems, Cape Cod, MA, USA. find
  7. Hazen T.J., Seneff S. and Polifroni J. 2002. Recognition Confidence Scoring and Its Use in Speech Understanding Systems. Computer Speech and Language, pp. 49–67. Academic Press, vol. 16, N° 1. ↗
  8. Heeman P.A. and Allen J.F. 1996. Combining the Detection and Correction of Speech Repairs. In Proceedings of International Conference of Spoken Language Processing, pp. 363–365. Philadelphia, PA, USA. find
  9. Minker W. and Bennacef S. 2005. Speech and Human-Machine Dialog. Computational Linguistics. Vol. 31, pp. 157—158. ↗
  10. Schaaf T. 2001. Detection of OOV Words Using Generalized Word Models and a Semantic Class Language Model. European Conference on Speech Communication and Technology, pp. 2581—2584. Aalborg, Denmark. find
  11. Zouaghi A., Zrigui M. and Antoniadis, G. 2008. Compréhension Automatique de la Parole Arabe Spontanée : Une Modélisation Numérique. TAL, vol. 49, N°1, pp. 141—166. find

Updated

↑ back to top

This page in Markdown → https://md.research.elamur.ai/free/en/papers/bahou-2009-disfluency-out-vocabulary-word-processing/