Institutional Repository
Technical University of Crete
EN  |  EL

Search

Browse

My Space

Speech understanding for spoken dialogue systems: from corpus harvesting to grammar rule induction

Iosif Ilias, Klasinas Ioannis, Athanasopoulou Georgia, Palogiannidi Elisavet, Georgiladakis Spyridon, Louka Katerina, Potamianos Alexandros

Full record


URI: http://purl.tuc.gr/dl/dias/184E3D0D-4DCB-48FA-BD04-F7F06DFA4ACA
Year 2018
Type of Item Peer-Reviewed Journal Publication
License
Details
Bibliographic Citation E. Iosif, I. Klasinas, G. Athanasopoulou, E. Palogiannidi, S. Georgiladakis, K. Louka and A. Potamianos, "Speech understanding for spoken dialogue systems: from corpus harvesting to grammar rule induction," Comput. Speech Lang., vol. 47, pp. 272-297, Jan. 2018. doi: 10.1016/j.csl.2017.08.002 https://doi.org/10.1016/j.csl.2017.08.002
Appears in Collections

Summary

We investigate algorithms and tools for the semi-automatic authoring of grammars for spoken dialogue systems (SDS) proposing a framework that spans from corpora creation to grammar induction algorithms. A realistic human-in-the-loop approach is followed balancing automation and human intervention to optimize cost to performance ratio for grammar development. Web harvesting is the main approach investigated for eliciting spoken dialogue textual data, while crowdsourcing is also proposed as an alternative method. Several techniques are presented for constructing web queries and filtering the acquired corpora. We also investigate how the harvested corpora can be used for the automatic and semi-automatic (human-in-the-loop) induction of grammar rules. SDS grammar rules and induction algorithms are grouped into two types, namely, low- and high-level. Two families of algorithms are investigated for rule induction: one based on semantic similarity and distributional semantic models, and the other using more traditional statistical modeling approaches (e.g., slot-filling algorithms using Conditional Random Fields). Evaluation results are presented for two domains and languages. High-level induction precision scores up to 60% are obtained. Results advocate the portability of the proposed features and algorithms across languages and domains.

Services

Statistics