کد مقاله کد نشریه سال انتشار مقاله انگلیسی ترجمه فارسی نسخه تمام متن
4973650 1365496 2018 26 صفحه PDF ندارد دانلود رایگان
عنوان انگلیسی مقاله
Speech understanding for spoken dialogue systems: From corpus harvesting to grammar rule induction☆
کلمات کلیدی
Spoken dialogue systems; Grammar induction; Corpora creation; Semantic similarity; Web mining; Crowdsourcing;
موضوعات مرتبط
مهندسی و علوم پایه مهندسی کامپیوتر پردازش سیگنال
پیش نمایش صفحه اول مقاله
Speech understanding for spoken dialogue systems: From corpus harvesting to grammar rule induction☆
چکیده انگلیسی

•We investigate algorithms for inducing grammars for spoken dialogue systems.•Main tasks: creation of text corpora; induction of low- and high-level grammars.•The proposed algorithms and features are portable across languages and domains.•Different features should be applied for low- and high-level grammar rules.•Web data harvesting is a plausible approach for corpora creation.

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.

ناشر
Database: Elsevier - ScienceDirect (ساینس دایرکت)
Journal: Computer Speech & Language - Volume 47, January 2018, Pages 272-297
نویسندگان
, , , , , , ,